1995 search results - page 136 / 399 » What's the Problem |
125
click to vote
AI
2004
Springer
15 years 4 months ago
2004
Springer
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
151
click to vote
JUCS
2010
14 years 11 months ago
2010
: We initiate in this work the study of a sort of redundancy problem revealed by what we call redundant relations. Roughly, we define a redundant relation in a database instance (d...
121
Voted
DESRIST
2009
Springer
15 years 7 months ago
2009
Springer
As a result of the rigor vs. relevance debate, researchers who focus on design research on organizational problems are beginning to focus on their research methodology’s rigor. ...
125
click to vote
AAAI
2007
15 years 6 months ago
2007
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
114
click to vote
IJCAI
1989
15 years 5 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...