Sciweavers

5624 search results - page 41 / 1125
» On Conditional Covering Problem
Sort
View
97
Voted
IROS
2008
IEEE
161views Robotics» more  IROS 2008»
15 years 8 months ago
A perception mechanism for supporting autonomous intersection handling in urban driving
Abstract— Knowledge of the driving environment is essential for robotic vehicles to comply with traffic rules while autonomously traversing intersections. However, due to limite...
Young-Woo Seo, Chris Urmson
JDWM
2007
122views more  JDWM 2007»
15 years 2 months ago
A Hyper-Heuristic for Descriptive Rule Induction
Rule induction from examples is a machine learning technique that finds rules of the form condition → class, where condition and class are logic expressions of the form variable...
Tho Hoan Pham, Tu Bao Ho
FAW
2008
Springer
137views Algorithms» more  FAW 2008»
15 years 4 months ago
Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
Guoqiang Bai 0002, Henning Fernau
ORL
1998
97views more  ORL 1998»
15 years 2 months ago
The complexity of cover inequality separation
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
Diego Klabjan, George L. Nemhauser, Craig A. Tovey
96
Voted
ICCNMC
2005
Springer
15 years 8 months ago
Minimum Disc Cover Set Construction in Mobile Ad Hoc Networks
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
Min-Te Sun, Xiaoli Ma, Chih-Wei Yi, Chuan-Kai Yang...