Sciweavers

2799 search results - page 101 / 560
» The regenerator location problem
Sort
View
CPAIOR
2006
Springer
14 years 2 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
ISMB
1997
14 years 15 days ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey
ENTCS
2006
113views more  ENTCS 2006»
13 years 11 months ago
Concurrent Java Test Generation as a Search Problem
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
Yaniv Eytani
WSC
2007
14 years 1 months ago
A simulation-based algorithm for supply chain optimization
In a supply chain, there are wide variety of problems, such as transportation scheduling problems and warehouse location problems. These problems are independently defined as opt...
Takayuki Yoshizumi, Hiroyuki Okano
ADBIS
2009
Springer
108views Database» more  ADBIS 2009»
14 years 5 months ago
Probabilistic Granule-Based Inside and Nearest Neighbor Queries
The development of location-based services and advances in the field of mobile computing have motivated an intensive research effort devoted to the efficient processing of locati...
Sergio Ilarri, Antonio Corral, Carlos Bobed, Eduar...