1477 search results - page 92 / 296 » On Graph Problems in a Semi-streaming Model |
107
click to vote
DAM
2008
15 years 1 months ago
2008
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
122
click to vote
IJAMCIGI
2010
14 years 8 months ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
101
click to vote
SAC
2009
ACM
15 years 8 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
124
click to vote
NLDB
2007
Springer
15 years 7 months ago
2007
Springer
Most of Information Retrieval (IR) systems are still based on bag of word paradigm. This is a strong limitation if one needs high precision answers. For example, in restricted doma...
129
click to vote
SMA
2003
ACM
15 years 6 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...