Sciweavers

3946 search results - page 287 / 790
» The computational complexity of choice sets
Sort
View
ATAL
2005
Springer
16 years 9 days ago
Negotiating over small bundles of resources
When rational but myopic agents negotiate over the exchange of indivisible resources, any restriction to the negotiation protocol may prevent the system from converging to a socia...
Yann Chevaleyre, Ulle Endriss, Jérôme...
ICLP
2005
Springer
16 years 8 days ago
Nondeterminism Analysis of Functional Logic Programs
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
Bernd Braßel, Michael Hanus
PSIVT
2009
Springer
211views Multimedia» more  PSIVT 2009»
15 years 11 months ago
Inclusion of a Second-Order Prior into Semi-Global Matching
Today’s stereo vision algorithms and computing technology allow real-time 3D data analysis, for example for driver assistance systems. A recently developed Semi-Global Matching (...
Simon Hermann, Reinhard Klette, Eduardo Destefanis
JAIR
2006
160views more  JAIR 2006»
15 years 6 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
EOR
2007
96views more  EOR 2007»
15 years 6 months ago
A balancing method and genetic algorithm for disassembly line balancing
Disassembly activities take place in various recovery operations including remanufacturing, recycling and disposal. The disassembly line is the best choice for automated disassemb...
Seamus M. McGovern, Surendra M. Gupta