Sciweavers

551 search results - page 110 / 111
» Continuous Search in Constraint Programming
Sort
View
CP
2004
Springer
14 years 29 days ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...
IPPS
2000
IEEE
13 years 12 months ago
A General Parallel Simulated Annealing Library and its Application in Airline Industry
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
Georg Kliewer, Stefan Tschöke
FOCS
1998
IEEE
13 years 11 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
BMCBI
2008
152views more  BMCBI 2008»
13 years 7 months ago
Predicting biological system objectives de novo from internal state measurements
Background: Optimization theory has been applied to complex biological systems to interrogate network properties and develop and refine metabolic engineering strategies. For examp...
Erwin P. Gianchandani, Matthew A. Oberhardt, Antho...
AI
1998
Springer
13 years 7 months ago
Remote Agent: To Boldly Go Where No AI System Has Gone Before
Renewed motives for space exploration have inspired NASA to work toward the goal of establishing a virtual presence in space, through heterogeneous eets of robotic explorers. Info...
Nicola Muscettola, P. Pandurang Nayak, Barney Pell...