1487 search results - page 65 / 298 » The Computational Complexity of Link Building |
106
Voted
EUROCOLT
1999
Springer
15 years 5 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
102
click to vote
IROS
2007
IEEE
15 years 7 months ago
2007
IEEE
— We present a novel algorithm for motion planning of multiple robots amongst dynamic obstacles. Our approach is based on a new roadmap representation that uses deformable links ...
101
click to vote
LCN
2007
IEEE
15 years 7 months ago
2007
IEEE
—This paper presents a distributed algorithm to direct evacuees to exits through arbitrarily complex building layouts in emergency situations. The algorithm finds the safest pat...
BIRTHDAY
1991
Springer
15 years 5 months ago
1991
Springer
: In this paper, we present a software engineer's view of user-interface development. First, we illustrate the main problem areas responsible for difficulties in building high...
112
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...