Sciweavers

6976 search results - page 11 / 1396
» The Oil Searching Problem
Sort
View
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
15 years 1 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
15 years 3 months ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin
SAT
2010
Springer
172views Hardware» more  SAT 2010»
14 years 8 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
NPAR
2010
ACM
15 years 2 months ago
Detail-preserving paint modeling for 3D brushes
Recent years have witnessed significant advances in 3D brush modeling and simulation in digital paint tools. Compared with traditional 2D brushes, a 3D brush can be both more intu...
Nelson Siu-Hang Chu, William Baxter, Li-Yi Wei, Na...
JAIR
2006
90views more  JAIR 2006»
14 years 9 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...