Sciweavers

4218 search results - page 465 / 844
» Complete sets of cooperations
Sort
View
GIS
2006
ACM
15 years 7 months ago
Swarming methods for geospatial reasoning
Geospatial data is often used to predict or recommend movements of robots, people, or animals ("walkers"). Analysis of such systems can be combinatorially explosive. Eac...
H. Van Dyke Parunak, Sven Brueckner, Robert S. Mat...
IANDC
2006
86views more  IANDC 2006»
15 years 7 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 7 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
INFSOF
2006
151views more  INFSOF 2006»
15 years 7 months ago
Prioritized interaction testing for pair-wise coverage with seeding and constraints
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and so...
Renée C. Bryce, Charles J. Colbourn
JAPLL
2006
109views more  JAPLL 2006»
15 years 7 months ago
Deduction chains for common knowledge
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
Mathis Kretz, Thomas Studer