Sciweavers

7167 search results - page 992 / 1434
» Answer Set Programming
Sort
View
AUTOMATICA
2008
134views more  AUTOMATICA 2008»
15 years 4 months ago
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
COR
2008
99views more  COR 2008»
15 years 4 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
129
Voted
COR
2008
164views more  COR 2008»
15 years 4 months ago
Observations in using parallel and sequential evolutionary algorithms for automatic software testing
In this paper we analyze the application of parallel and sequential evolutionary algorithms (EAs) to the automatic test data generation problem. The problem consists of automatica...
Enrique Alba, J. Francisco Chicano
143
Voted
CORR
2008
Springer
124views Education» more  CORR 2008»
15 years 4 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh
EAAI
2008
101views more  EAAI 2008»
15 years 4 months ago
A global constraint for total weighted completion time for cumulative resources
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
András Kovács, J. Christopher Beck