1952 search results - page 312 / 391 » Complete partitions of graphs |
152
click to vote
FLAIRS
2004
15 years 6 months ago
2004
The necessity for improved players and opponents in firstperson entertainment-based real-time artificial environments has inspired our research into artificial game players. We em...
138
click to vote
IIS
2003
15 years 6 months ago
2003
Current research on the VINLEN inductive database system is briefly reviewed and illustrated by selected results. The goal of research on VINLEN is to develop a methodology for de...
159
click to vote
KRDB
2003
15 years 6 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
147
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
124
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...