7 search results - page 1 / 2 » Using Infeasibility to Improve Abstraction-Based Heuristics |
SARA
2007
Springer
13 years 11 months ago
2007
Springer
COR
2008
13 years 5 months ago
2008
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
ICRA
2005
IEEE
13 years 11 months ago
2005
IEEE
— Probabilistic sampling-based motion planners are unable to detect when no feasible path exists. A common heuristic is to declare a query infeasible if a path is not found in a ...
ICSE
2012
IEEE-ACM
11 years 7 months ago
2012
IEEE-ACM
Abstract—Customizable programs and program families provide user-selectable features to allow users to tailor a program to an application scenario. Knowing in advance which featu...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—In sensor networks, both energy and bandwidth are scarce resources. In the past, many energy efficient routing algorithms have been devised in order to maximize network lifetim...