Sciweavers

498 search results - page 11 / 100
» An algorithm to solve integer linear systems exactly using n...
Sort
View
COR
2006
65views more  COR 2006»
13 years 7 months ago
An exact method for graph coloring
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
Corinne Lucet, Florence Mendes, Aziz Moukrim
HYBRID
2000
Springer
13 years 11 months ago
Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods
Abstract. Sincehybridembeddedsystemsarepervasiveandoftensafetycritical, guarantees about their correct performance are desirable. The hybrid systemsmodelcheckerHyTech providessuch ...
Thomas A. Henzinger, Benjamin Horowitz, Rupak Maju...
CASC
2005
Springer
113views Mathematics» more  CASC 2005»
14 years 1 months ago
Real Solving of Bivariate Polynomial Systems
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
Ioannis Z. Emiris, Elias P. Tsigaridas
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
DAGSTUHL
2006
13 years 9 months ago
Adaptive Triangular System Solving
Abstract. We propose a new adaptive algorithm for the exact simultaneous resolution of several triangular systems over finite fields: it is composed of several practicable variants...
Jean-Guillaume Dumas, Clément Pernet, Jean-...