Sciweavers

1263 search results - page 157 / 253
» A* with Bounded Costs
Sort
View
ASPDAC
1995
ACM
108views Hardware» more  ASPDAC 1995»
14 years 27 days ago
Synthesis-for-testability using transformations
- We address the problem of transforming a behavioral specification so that synthesis of a testable implementation from the new specification requires significantly less area and ...
Miodrag Potkonjak, Sujit Dey, Rabindra K. Roy
AISC
2008
Springer
13 years 11 months ago
Validated Evaluation of Special Mathematical Functions
Because of the importance of special functions, several books and a large collection of papers have been devoted to the numerical computation of these functions, the most well-know...
Franky Backeljauw, Stefan Becuwe, Annie A. M. Cuyt
CP
2008
Springer
13 years 11 months ago
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...
Michael J. Maher, Nina Narodytska, Claude-Guy Quim...
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
13 years 10 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
UAI
2004
13 years 10 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown