Sciweavers

2917 search results - page 158 / 584
» Satisfying Interaction Constraints
Sort
View
DEBS
2009
ACM
14 years 2 months ago
Efficient event-based resource discovery
The ability to find services or resources that satisfy some criteria is an important aspect of distributed systems. This paper presents an event-based architecture to support more...
Wei Yan, Songlin Hu, Vinod Muthusamy, Hans-Arno Ja...
ECAI
2006
Springer
14 years 1 months ago
Random Subset Optimization
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
Boi Faltings, Quang Huy Nguyen
NIPS
2004
13 years 11 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
FORMATS
2010
Springer
13 years 8 months ago
Robust Satisfaction of Temporal Logic over Real-Valued Signals
Abstract. We consider temporal logic formulae specifying constraints in continuous time and space on the behaviors of continuous and hybrid dynamical system admitting uncertain par...
Alexandre Donzé, Oded Maler
SIAMJO
2010
89views more  SIAMJO 2010»
13 years 4 months ago
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...
Roberto Andreani, José Mario Martíne...