Sciweavers

9119 search results - page 1535 / 1824
» A Simultaneous Search Problem
Sort
View
ATAL
2003
Springer
15 years 9 months ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
CP
2003
Springer
15 years 9 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
LICS
2002
IEEE
15 years 9 months ago
Little Engines of Proof
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
Natarajan Shankar
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
15 years 8 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 8 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
« Prev « First page 1535 / 1824 Last » Next »