Sciweavers

13376 search results - page 213 / 2676
» Problem Solving with
Sort
View
111
Voted
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 3 months ago
Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
Uwe Aickelin, Kathryn A. Dowsland
116
Voted
JDA
2007
97views more  JDA 2007»
15 years 3 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
EOR
2007
111views more  EOR 2007»
15 years 3 months ago
A pegging approach to the precedence-constrained knapsack problem
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
Byungjun You, Takeo Yamada
151
Voted
FOCS
1999
IEEE
15 years 7 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
126
Voted
ECAI
2010
Springer
15 years 4 months ago
LP Solvable Models for Multiagent Fair Allocation Problems
This paper proposes several operational approaches for solving fair allocation problems in the context of multiagent optimization. These problems arise in various contexts such as ...
Julien Lesca, Patrice Perny