Sciweavers

2107 search results - page 339 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ASAP
2007
IEEE
107views Hardware» more  ASAP 2007»
14 years 3 months ago
A Hardware-Oriented Method for Evaluating Complex Polynomials
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
Milos D. Ercegovac, Jean-Michel Muller
EDUTAINMENT
2007
Springer
14 years 3 months ago
Interactive Composition of 3D Faces for Virtual Characters
As many 3D on-line games appear, there is an increased need for simple and efficient techniques to create many new faces. This paper presents a new algorithm to composite 3D faces ...
Haeyoung Lee, Sungyeol Lee
ICDCS
1995
IEEE
14 years 17 days ago
A Competitive Analysis for Retransmission Timeout
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
Shlomi Dolev, Michael Kate, Jennifer L. Welch
IJCAI
2003
13 years 10 months ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
JACM
2010
116views more  JACM 2010»
13 years 7 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára