Sciweavers

63 search results - page 6 / 13
» Satisfaction balanced mediation
Sort
View
AGILEDC
2003
IEEE
14 years 1 months ago
Observations on Balancing Discipline and Agility
Agile development methodologies promise higher customer satisfaction, lower defect rates, faster development times and a solution to rapidly changing requirements. Plan-driven app...
Barry W. Boehm, Richard Turner
AAAI
2006
13 years 10 months ago
The Impact of Balancing on Problem Hardness in a Highly Structured Domain
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
Carlos Ansótegui, Ramón Béjar...
IJCAI
2001
13 years 10 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
CIA
2008
Springer
13 years 10 months ago
Collaborative Load-Balancing in Storage Networks Using Agent Negotiation
Abstract. The rapid advances in the computer industry allow building larger systems that require mass storage volumes. As storage space increases, its management becomes increasing...
Shay Raz, Raz Lin, Onn Shehory
IAT
2007
IEEE
14 years 2 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels