Sciweavers

2100 search results - page 89 / 420
» Fundamentals of the problem
Sort
View
ICRA
2007
IEEE
157views Robotics» more  ICRA 2007»
16 years 19 days ago
Towards Mapping of Cities
— Map learning is a fundamental task in mobile robotics because maps are required for a series of high level applications. In this paper, we address the problem of building maps ...
Patrick Pfaff, Rudolph Triebel, Cyrill Stachniss, ...
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 6 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
GECCO
2009
Springer
16 years 27 days ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
FOCS
2002
IEEE
15 years 11 months ago
A Dichotomy Theorem for Constraints on a Three-Element Set
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
Andrei A. Bulatov
CSB
2005
IEEE
166views Bioinformatics» more  CSB 2005»
15 years 12 months ago
Automated Validation of Polymerase Chain Reactions Using Amplicon Melting Curves
PCR, the polymerase chain reaction, is a fundamental tool of molecular biology. Quantitative PCR is the goldstandard methodology for determination of DNA copy numbers, quantitatin...
Tobias P. Mann, Richard Humbert, John A. Stamatoya...