Sciweavers

330 search results - page 35 / 66
» Diagnosing and Solving Over-Determined Constraint Satisfacti...
Sort
View
PRICAI
1998
Springer
14 years 7 days ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
AAAI
2006
13 years 9 months ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
Robert T. Effinger, Brian C. Williams
FLAIRS
2006
13 years 9 months ago
Full Restart Speeds Learning
Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solv...
Smiljana Petrovic, Susan L. Epstein
NOMS
2000
IEEE
141views Communications» more  NOMS 2000»
14 years 12 days ago
IconoNET: a tool for automated bandwidth allocation planning
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
Christian Frei, Boi Faltings, George Melissargos, ...
WIOPT
2011
IEEE
12 years 11 months ago
Portfolio optimization in secondary spectrum markets
—In this paper, we address the spectrum portfolio optimization (SPO) question in the context of secondary spectrum markets, where bandwidth (spectrum access rights) can be bought...
Praveen Kumar Muthuswamy, Koushik Kar, Aparna Gupt...