979 search results - page 188 / 196 » Footprints in Local Reasoning |
128
click to vote
AAAI
2000
15 years 4 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
143
Voted
ECIS
2000
15 years 4 months ago
2000
- The measurement and assessment of health status in communities throughout the world is a massive information technology challenge. The Comprehensive Assessment for Tracking Commu...
144
Voted
ISMB
2000
15 years 4 months ago
2000
Mycobacterium tuberculosis (M. tb.) strains differ in the number and locations of a transposon-like insertion sequence known as IS6110. Accurate detection of this sequence can be ...
159
click to vote
AAAI
1994
15 years 4 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
155
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...