Sciweavers

2988 search results - page 276 / 598
» Experiments with a New Boosting Algorithm
Sort
View
ASIAMS
2007
IEEE
15 years 10 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
ICRA
2007
IEEE
140views Robotics» more  ICRA 2007»
15 years 10 months ago
Dribbling Control of Omnidirectional Soccer Robots
Abstract— This paper focuses on the dribbling control problem of an omnidirectional mobile robot. Because the movement of the dribbled object must be considered, dribbling contro...
Xiang Li, Maosen Wang, Andreas Zell
142
Voted
CP
2007
Springer
15 years 10 months ago
Filtering for Subgraph Isomorphism
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...
Stéphane Zampelli, Yves Deville, Christine ...
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
15 years 10 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
15 years 10 months ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...