Sciweavers

7380 search results - page 1382 / 1476
» time 2008
Sort
View
FDL
2008
IEEE
15 years 10 months ago
Contradiction Analysis for Constraint-based Random Simulation
Constraint-based random simulation is state-of-the-art in verification of multi-million gate industrial designs. This method is based on stimulus generation by constraint solving...
Daniel Große, Robert Wille, Robert Siegmund,...
AIPS
2008
15 years 6 months ago
Learning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
Tomás de la Rosa, Sergio Jiménez, Da...
EDBT
2008
ACM
159views Database» more  EDBT 2008»
16 years 4 months ago
Deleting index entries from compliance storage
In response to regulatory focus on secure retention of electronic records, businesses are using magnetic disks configured as write-once read-many (WORM) compliance storage devices...
Soumyadeb Mitra, Marianne Winslett, Nikita Borisov
ATAL
2008
Springer
15 years 6 months ago
Adaptive multi-robot wide-area exploration and mapping
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
15 years 5 months ago
Stabbing Convex Polygons with a Segment or a Polygon
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. G...
« Prev « First page 1382 / 1476 Last » Next »