2657 search results - page 147 / 532 » On the complexity of hierarchical problem solving |
106
click to vote
COCO
2005
Springer
15 years 7 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
117
click to vote
FORMATS
2008
Springer
15 years 3 months ago
2008
Springer
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
125
click to vote
PUK
2001
15 years 3 months ago
2001
The sales of customisable products and services over the internet is a challenging task within the area of electronic commerce. In this chapter we will present a case study which s...
130
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
231
Voted
POPL
2004
ACM
16 years 2 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...