Sciweavers

2446 search results - page 13 / 490
» Where am I
Sort
View
SIAMDM
1998
55views more  SIAMDM 1998»
13 years 9 months ago
Multiple Capacity Vehicle Routing on Paths
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
D. J. Guan, Xuding Zhu
AGENTS
1999
Springer
14 years 2 months ago
Where to Look? Automating Attending Behaviors of Virtual Human Characters
This research proposes a computational framework for generating visual attending behavior in an embodied simulated human agent. Such behaviors directly control eye and head motion...
Sonu Chopra-Khullar, Norman I. Badler
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 10 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
DATE
2003
IEEE
82views Hardware» more  DATE 2003»
14 years 3 months ago
Scaling into Ambient Intelligence
Envision the situation that high quality information and entertainment is easily accessible to anyone, anywhere, at any time, and on any device. How realistic is this vision? And ...
Twan Basten, Luca Benini, Anantha Chandrakasan, Me...
STOC
2010
ACM
199views Algorithms» more  STOC 2010»
14 years 2 months ago
Zero-One Frequency Laws
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMS...
Vladimir Braverman and Rafail Ostrovsky