1453 search results - page 284 / 291 » Partial Constraint Satisfaction |
CODES
2004
IEEE
14 years 1 months ago
2004
IEEE
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
DNA
2006
Springer
14 years 1 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
ECCV
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. This paper presents an endoscopic vision framework for modelbased 3D guidance of surgical instruments used in robotized laparoscopic surgery. In order to develop such a s...
AAAI
2008
14 years 12 days ago
2008
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
AAAI
2010
13 years 11 months ago
2010
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...