Sciweavers

3656 search results - page 140 / 732
» Compact Location Problems
Sort
View
CPAIOR
2006
Springer
15 years 4 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
88
Voted
ISMB
1997
15 years 2 months 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»
15 years 25 days 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
114
Voted
WSC
2007
15 years 3 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
100
Voted
SCALESPACE
2007
Springer
15 years 7 months ago
Linear Image Reconstruction by Sobolev Norms on the Bounded Domain
The reconstruction problem is usually formulated as a variational problem in which one searches for that image that minimizes a so called prior (image model) while insisting on cer...
Bart Janssen, Remco Duits, Bart M. ter Haar Romeny