Sciweavers

1012 search results - page 38 / 203
» Segment intersection searching problems in general settings
Sort
View
DAM
2008
135views more  DAM 2008»
14 years 12 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 3 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
ROBOCOMM
2007
IEEE
15 years 6 months ago
Distributed adaptive sampling using bounded-errors
—This paper presents a communication/coordination/ processing architecture for distributed adaptive observation of a spatial field using a fleet of autonomous mobile sensors. O...
Kévin Huguenin, Maria-João Rendas
ICASSP
2011
IEEE
14 years 3 months ago
A-Functions: A generalization of Extended Baum-Welch transformations to convex optimization
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
Dimitri Kanevsky, David Nahamoo, Tara N. Sainath, ...
TASE
2010
IEEE
14 years 6 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen