Sciweavers

6315 search results - page 296 / 1263
» Approximating Solution Structure
Sort
View
FLAIRS
2004
15 years 8 months ago
CSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
Koenraad Mertens, Tom Holvoet
CORR
2008
Springer
139views Education» more  CORR 2008»
15 years 6 months ago
Exact two-terminal reliability of some directed networks
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
Christian Tanguy
AI
2006
Springer
15 years 6 months ago
Constraint-based optimization and utility elicitation using the minimax decision criterion
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...
TIP
1998
99views more  TIP 1998»
15 years 6 months ago
Nonlinear image estimation using piecewise and local image models
—We introduce a new approach to image estimation based on a flexible constraint framework that encapsulates meaningful structural image assumptions. Piecewise image models (PIMâ...
Scott T. Acton, Alan C. Bovik
167
Voted
STOC
2006
ACM
131views Algorithms» more  STOC 2006»
16 years 7 months ago
On maximizing welfare when utility functions are subadditive
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
Uriel Feige