Sciweavers

6455 search results - page 207 / 1291
» Research problems
Sort
View
AMCS
2010
146views Mathematics» more  AMCS 2010»
15 years 6 months ago
Sensor network design for the estimation of spatially distributed processes
satisfactory network connectivity have dominated this line of research and abstracted away from the mathematical description of the physical processes underlying the observed pheno...
Dariusz Ucinski, Maciej Patan
AI
2004
Springer
15 years 6 months ago
On the computational complexity of qualitative coalitional games
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
Michael Wooldridge, Paul E. Dunne
PAMI
2011
15 years 1 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
CPAIOR
2011
Springer
14 years 10 months ago
Upgrading Shortest Paths in Networks
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
Bistra N. Dilkina, Katherine J. Lai, Carla P. Gome...
CCS
2007
ACM
16 years 20 days ago
Optimal security hardening using multi-objective optimization on attack tree models of networks
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
Rinku Dewri, Nayot Poolsappasit, Indrajit Ray, Dar...