1458 search results - page 166 / 292 » Monads for incremental computing |
119
Voted
ICSE
2004
IEEE-ACM
16 years 3 months ago
2004
IEEE-ACM
FLAVERS is a finite-state verification approach that allows an analyst to incrementally add constraints to improve the precision of the model of the system being analyzed. Except ...
131
Voted
ICCD
2004
IEEE
16 years 18 days ago
2004
IEEE
ACG (Adjacent Constraint Graph) is invented as a general floorplan representation. It has advantages of both adjacency graph and constraint graph of a floorplan: edges in an ACG...
145
Voted
ICCAD
2004
IEEE
16 years 17 days ago
2004
IEEE
— This paper presents Hermes, a depth-optimal LUT based FPGA mapping algorithm. The presented algorithm is based on a new strategy for finding LUTs allowing to find a good LUT ...
136
Voted
HRI
2010
ACM
15 years 10 months ago
2010
ACM
—Natural human-robot interaction requires different and more robust models of language understanding (NLU) than non-embodied NLU systems. In particular, architectures are require...
118
click to vote
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...