900 search results - page 125 / 180 » On Polynomial Time Computation over Unordered Structures |
128
click to vote
PPNA
2011
14 years 6 months ago
2011
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
233
Voted
FCCM
2011
IEEE
14 years 7 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
150
click to vote
SIGGRAPH
2010
ACM
15 years 7 months ago
2010
ACM
We introduce gesture controllers, a method for animating the body language of avatars engaged in live spoken conversation. A gesture controller is an optimal-policy controller tha...
136
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users t...
154
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...