Sciweavers

6693 search results - page 1248 / 1339
» On an anytime algorithm for control
Sort
View
JACM
2000
86views more  JACM 2000»
13 years 7 months ago
Periodification scheme: constructing sorting networks with constant period
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...
JAIR
2000
123views more  JAIR 2000»
13 years 7 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
IJRR
2002
175views more  IJRR 2002»
13 years 7 months ago
Navigation Strategies for Exploring Indoor Environments
This paper investigates safe and efficient map-building strategies for a mobile robot with imperfect control and sensing. In the implementation, a robot equipped with a range sens...
Héctor H. González-Baños, Jea...
COMPUTER
1999
69views more  COMPUTER 1999»
13 years 7 months ago
Scientific Components Are Coming
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
Paul F. Dubois
JAR
1998
134views more  JAR 1998»
13 years 7 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge
« Prev « First page 1248 / 1339 Last » Next »