Sciweavers

673 search results - page 56 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
ATAL
2010
Springer
13 years 7 months ago
Time constraints in mixed multi-unit combinatorial auctions
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
Andreas Witzel, Ulle Endriss
IV
2003
IEEE
98views Visualization» more  IV 2003»
14 years 28 days ago
A new approach to virtual design for spatial configuration problems
In this paper, we present a new framework for the use of Virtual Reality (VR) in engineering design for configuration applications. Traditional VR systems support the visual explo...
Carlos Calderon, Marc Cavazza, Daniel Diaz
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
13 years 11 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
CP
2004
Springer
14 years 1 months ago
Constraint Propagation as a Proof System
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
Albert Atserias, Phokion G. Kolaitis, Moshe Y. Var...
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
14 years 12 days ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff