7129 search results - page 330 / 1426 » Approximation Algorithms for Treewidth |
131
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
143
click to vote
SMI
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
124
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
140
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
State estimation consists of updating an agent’s belief given executed actions and observed evidence to date. In single agent environments, the state estimation can be formalize...
142
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....