2080 search results - page 231 / 416 » Measuring empirical computational complexity |
161
click to vote
SARA
2009
Springer
16 years 14 days ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
146
click to vote
CEC
2008
IEEE
16 years 12 days ago
2008
IEEE
—This paper reviews the different gradient-based schemes and the sources of gradient, their availability, precision and computational complexity, and explores the benefits of usi...
156
click to vote
HAPTICS
2007
IEEE
16 years 8 days ago
2007
IEEE
Haptic interactions with stiff virtual surfaces feel more realistic when a short-duration transient is added to the spring force at contact. But how should this event-based transi...
157
click to vote
HICSS
2006
IEEE
15 years 12 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
155
click to vote
HRI
2006
ACM
15 years 12 months ago
2006
ACM
Autonomous robots use sensors to perceive and track objects in the world. Tracking algorithms use object motion models to estimate the position of a moving object. Tracking effic...