Sciweavers

1589 search results - page 98 / 318
» Constraints with Variables' Annotations
Sort
View
UAI
2003
13 years 10 months ago
CLP(BN): Constraint Logic Programming for Probabilistic Knowledge
Abstract. In Datalog, missing values are represented by Skolem constants. More generally, in logic programming missing values, or existentially quantified variables, are represent...
Vítor Santos Costa, David Page, Maleeha Qaz...
CEC
2007
IEEE
13 years 9 months ago
Designing memetic algorithms for real-world applications using self-imposed constraints
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
Thomas Michelitsch, Tobias Wagner, Dirk Biermann, ...
AMC
2006
107views more  AMC 2006»
13 years 9 months ago
Linear bilevel programming with upper level constraints depending on the lower level solution
Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In th...
Ayalew Getachew Mersha, Stephan Dempe
SEFM
2008
IEEE
14 years 3 months ago
Nullness Analysis in Boolean Form
Attempts to dereference null result in an exception or a segmentation fault. Hence it is important to know those program points where this might occur and prove the others (or the...
Fausto Spoto
CONCUR
1997
Springer
14 years 1 months ago
Probabilistic Concurrent Constraint Programming
Abstract. We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat