Sciweavers

461 search results - page 42 / 93
» Splitting NP-Complete Sets
Sort
View
PATAT
2004
Springer
129views Education» more  PATAT 2004»
14 years 4 months ago
A Novel Similarity Measure for Heuristic Selection in Examination Timetabling
Metaheuristic approaches to examination timetabling problems are usually split up into two phases: initialisation phase in which a heuristic is employed to construct an initial sol...
Yong Yang, Sanja Petrovic
ICRA
2002
IEEE
111views Robotics» more  ICRA 2002»
14 years 3 months ago
Feature-Based Multi-Hypothesis Localization and Tracking for Mobile Robots using Geometric Constraints
In this paper we present a new probabilistic feature-based approach to multi-hypothesis global localization and pose tracking. Hypotheses are generated using a constraintbased sea...
Kai Oliver Arras, José A. Castellanos, Rola...
FUN
2010
Springer
285views Algorithms» more  FUN 2010»
14 years 3 months ago
An Algorithmic Analysis of the Honey-Bee Game
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
Rudolf Fleischer, Gerhard J. Woeginger
EDOC
2000
IEEE
14 years 3 months ago
A Component-Based Groupware Development Methodology
Software development in general and groupware applications in particular can greatly benefit from the reusability and interoperability aspects associated with software components....
Cléver Ricardo Guareis de Farias, Luí...
RTCSA
2000
IEEE
14 years 3 months ago
Extracting safe and precise control flow from binaries
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
Henrik Theiling