Sciweavers

347 search results - page 57 / 70
» Schaefer's theorem for graphs
Sort
View
JCSS
1998
51views more  JCSS 1998»
14 years 9 months ago
Randomized Query Processing in Robot Path Planning
d Abstract) LYDIA E. KAVRAKI   JEAN-CLAUDE LATOMBE   RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motw...
GC
2010
Springer
14 years 8 months ago
Polyhedral Suspensions of Arbitrary Genus
A new class of polyhedra is discovered—bipyramids of arbitrarily prescribed genus. A two-dimensional generalization of Fáry’s Theorem is established. A purely combinatorial de...
Serge Lawrencenko
4OR
2010
137views more  4OR 2010»
14 years 9 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
92
Voted
ML
2006
ACM
143views Machine Learning» more  ML 2006»
14 years 9 months ago
Mathematical applications of inductive logic programming
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...
Simon Colton, Stephen Muggleton
GC
2011
Springer
14 years 4 months ago
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
Klas Markström, Andrew Thomason, Peter Wagner...