1146 search results - page 129 / 230 » Finite cupping sets |
FORTE
2009
13 years 8 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
GLOBECOM
2009
IEEE
13 years 8 months ago
2009
IEEE
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
ENTCS
2010
13 years 7 months ago
2010
mented Abstractions Matt Eldera,1 , Denis Gopanb,2 , and Thomas Repsa,b,3 a Computer Sciences Department, Univ. of Wisconsin; Madison, WI; USA b GrammaTech, Inc.; Ithaca, NY; USA ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
CDC
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper deals with the existence and synthesis of parameterized-(control) Lyapunov functions (p-(C)LFs) for discrete-time nonlinear systems that are possibly subject to constrai...