Sciweavers

283 search results - page 10 / 57
» Strategies to Minimize Problems in Global Requirements Elici...
Sort
View
FLAIRS
2007
15 years 2 months ago
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Diarmuid Grimes, Richard J. Wallace
AAAI
2006
15 years 1 months ago
Handling Self-Interest in Groups, with Minimal Cost
In group decision-making problems that involve selfinterested agents with private information, reaching socially optimal outcomes requires aligning the goals of individuals with t...
Ruggiero Cavallo
CCE
2005
14 years 11 months ago
Logic-based outer approximation for globally optimal synthesis of process networks
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
María Lorena Bergamini, Pío A. Aguir...
FLAIRS
2003
15 years 1 months ago
Meta-S: A Strategy-Oriented Meta-Solver Framework
Meta-S is a practical implementation and extension of the theoretical framework developed by Hofstedt, which allows the user to attack problems requiring the cooperation of arbitr...
Stephan Frank, Petra Hofstedt, Pierre R. Mai
CORR
2008
Springer
142views Education» more  CORR 2008»
14 years 11 months ago
On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay Channel
This paper considers a multiple input multiple output (MIMO) two-way relay channel, where two nodes want to exchange data with each other using multiple relays. An iterative algor...
Rahul Vaze, Robert W. Heath Jr.