Sciweavers

4565 search results - page 491 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
142
Voted
AAAI
1996
15 years 5 months ago
Monitoring the Progress of Anytime Problem-Solving
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...
Eric A. Hansen, Shlomo Zilberstein
DATE
2008
IEEE
78views Hardware» more  DATE 2008»
15 years 10 months ago
Simultaneous FU and Register Binding Based on Network Flow Method
– With the rapid increase of design complexity and the decrease of device features in nano-scale technologies, interconnection optimization in digital systems becomes more and mo...
Jason Cong, Junjuan Xu
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 4 months ago
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Julian John McAuley, Tibério S. Caetano, Ma...
VLSID
2002
IEEE
132views VLSI» more  VLSID 2002»
16 years 4 months ago
VLSI Architecture for a Flexible Motion Estimation with Parameters
If motion estimation can choose the most suitable algorithm according to the changing characteristics of input image signals, we can get benefits, which improve quality and perfor...
Jinku Choi, Nozomu Togawa, Masao Yanagisawa, Tatsu...
MASCOTS
2010
15 years 2 months ago
Efficient Web Requests Scheduling Considering Resources Sharing
Requests scheduling in Web servers is a hot research topic. Many works aim at providing optimal algorithms according to various metrics. Most of these works are based on classical ...
Simon Duquennoy, Gilles Grimaud