5995 search results - page 420 / 1199 » Algorithmic Game Theory |
179
click to vote
FOSSACS
2010
Springer
16 years 2 months ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
214
click to vote
COMPGEOM
2003
ACM
16 years 28 days ago
2003
ACM
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
206
click to vote
DOCENG
2003
ACM
16 years 28 days ago
2003
ACM
By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
221
click to vote
AAAI
2008
15 years 10 months ago
2008
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain...
213
click to vote
LFCS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...