Sciweavers

11740 search results - page 303 / 2348
» More Problems in Rewriting
Sort
View
156
Voted
CDC
2009
IEEE
166views Control Systems» more  CDC 2009»
15 years 11 months ago
Idempotent method for dynamic games and complexity reduction in min-max expansions
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...
William M. McEneaney
SAGA
2001
Springer
15 years 11 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
UML
2001
Springer
15 years 11 months ago
Using Alloy and UML/OCL to Specify Run-Time Configuration Management: A Case Study
: There are many different ways to specify the requirements of complex software systems, and the optimal methods often vary according to the problem domain. We apply and compare tw...
Geri Georg, Jores Bieman, Robert B. France
COMPGEOM
1998
ACM
15 years 11 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan
ECML
1993
Springer
15 years 10 months ago
Exploiting Context When Learning to Classify
This paper addresses the problem of classifying observations when features are context-sensitive, specifically when the testing set involves a context that is different from the t...
Peter D. Turney