Sciweavers

844 search results - page 81 / 169
» Solving the p
Sort
View
ATAL
2008
Springer
15 years 7 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
CP
2008
Springer
15 years 7 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
NIPS
2007
15 years 7 months ago
Comparing Bayesian models for multisensory cue combination without mandatory integration
Bayesian models of multisensory perception traditionally address the problem of estimating an underlying variable that is assumed to be the cause of the two sensory signals. The b...
Ulrik Beierholm, Konrad P. Körding, Ladan Sha...
142
Voted
ATAL
2010
Springer
15 years 6 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
ANOR
2007
108views more  ANOR 2007»
15 years 5 months ago
Towards a practical engineering tool for rostering
The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability to schedule their personnel properly. Sophisticated an...
Edward P. K. Tsang, John A. Ford, Patrick Mills, R...