Sciweavers

1813 search results - page 322 / 363
» Calculi of Approximation Spaces
Sort
View
162
Voted
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 10 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
137
Voted
CONEXT
2006
ACM
15 years 9 months ago
Synergy: blending heterogeneous measurement elements for effective network monitoring
Network traffic matrices are important for various network planning and management operations. Previous work for estimation of traffic matrices is based on either link load record...
Awais Ahmed Awan, Andrew W. Moore
136
Voted
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
15 years 9 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
142
Voted
ATAL
2005
Springer
15 years 9 months ago
Exploiting belief bounds: practical POMDPs for personal assistant agents
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users t...
Pradeep Varakantham, Rajiv T. Maheswaran, Milind T...
157
Voted
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 9 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin