Sciweavers

566 search results - page 84 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
122
Voted
MOBIHOC
2010
ACM
14 years 10 months ago
Breaking bidder collusion in large-scale spectrum auctions
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
Xia Zhou, Haitao Zheng
UAI
1997
15 years 1 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
103
Voted
HYBRID
2003
Springer
15 years 5 months ago
Hybrid Control Design for a Wheeled Mobile Robot
We present a hybrid systems solution to the problem of trajectory tracking for a four-wheel steered four-wheel driven mobile robot. The robot is modelled as a non-holonomic dynamic...
Thomas Bak, Jan Bendtsen, Anders P. Ravn
92
Voted
SIGGRAPH
1999
ACM
15 years 4 months ago
Physically Based Motion Transformation
We introduce a novel algorithm for transforming character animation sequences that preserves essential physical properties of the motion. By using the spacetime constraints dynami...
Zoran Popovic, Andrew P. Witkin
WISEC
2009
ACM
15 years 7 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...