Sciweavers

1670 search results - page 307 / 334
» On Skolemization in constructive theories
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 7 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
SOSP
2005
ACM
15 years 6 months ago
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...
IUI
2010
ACM
15 years 6 months ago
The why UI: using goal networks to improve user interfaces
People interact with interfaces to accomplish goals, and knowledge about human goals can be useful for building intelligent user interfaces. We suggest that modeling high, human-l...
Dustin Arthur Smith, Henry Lieberman
TACAS
2010
Springer
145views Algorithms» more  TACAS 2010»
15 years 4 months ago
Rational Synthesis
Abstract. Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. Modern systems oft...
Dana Fisman, Orna Kupferman, Yoad Lustig
IPSN
2010
Springer
15 years 4 months ago
Bayesian optimization for sensor set selection
We consider the problem of selecting an optimal set of sensors, as determined, for example, by the predictive accuracy of the resulting sensor network. Given an underlying metric ...
Roman Garnett, Michael A. Osborne, Stephen J. Robe...