1525 search results - page 90 / 305 » Matching with Regular Constraints |
108
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
In the past years Dynamic Voltage and Frequency Scaling (DVFS) has been an effective technique that allowed microprocessors to match a predefined power budget. However, as process...
152
Voted
RTA
2005
Springer
15 years 9 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
127
Voted
JEI
2006
15 years 3 months ago
2006
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
122
Voted
FLAIRS
2004
15 years 5 months ago
2004
What makes a good consistency ? Depending on the constraint, it may be a good pruning power or a low computational cost. By "weakening" arc-consistency, we propose to de...
116
click to vote
JCAM
2010
14 years 10 months ago
2010
Ill-posed problems are numerically underdetermined. It is therefore often beneficial to impose known properties of the desired solution, such as nonnegativity, during the solution...