3169 search results - page 253 / 634 » Robust Timed Automata |
133
click to vote
CPAIOR
2007
Springer
15 years 11 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
146
click to vote
LICS
2006
IEEE
15 years 11 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
142
click to vote
CONIELECOMP
2005
IEEE
15 years 10 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
160
click to vote
ACRI
2004
Springer
15 years 10 months ago
2004
Springer
Modeling free-form shapes in 3D spaces based on strict physical laws require a considerable amount of computation time. Previous experiences with Cellular Automata demonstrated sub...
146
click to vote
CAV
2003
Springer
15 years 10 months ago
2003
Springer
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...