Sciweavers

14054 search results - page 2691 / 2811
» P
Sort
View
ALGORITHMICA
2007
86views more  ALGORITHMICA 2007»
15 years 5 months ago
Detecting Holes and Antiholes in Graphs
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
Stavros D. Nikolopoulos, Leonidas Palios
APAL
2007
90views more  APAL 2007»
15 years 5 months ago
Guessing and non-guessing of canonical functions
It is possible to control to a large extent, via semiproper forcing, the parameters (β0, β1) measuring the guessing density of the members of any given antichain of stationary s...
David Asperó
APPML
2007
101views more  APPML 2007»
15 years 5 months ago
Extension of a theorem of Whitney
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
Paul C. Kainen, Shannon Overbay
AROBOTS
2008
158views more  AROBOTS 2008»
15 years 5 months ago
Learning traversability models for autonomous mobile vehicles
Autonomous mobile robots need to adapt their behavior to the terrain over which they drive, and to predict the traversability of the terrain so that they can effectively plan thei...
Michael Shneier, Tommy Chang, Tsai Hong, William P...
ARSCOM
2007
63views more  ARSCOM 2007»
15 years 5 months ago
Towards a Characterisation of Lottery Set Overlapping Structures
Consider a lottery scheme consisting of randomly selecting a winning t–set from a universal m–set, while a player participates in the scheme by purchasing a playing set of any...
Alewyn P. Burger, W. R. Grundlingh, Jan H. van Vuu...
« Prev « First page 2691 / 2811 Last » Next »