Sciweavers

ASPDAC
2004
ACM
144views Hardware» more  ASPDAC 2004»
13 years 8 months ago
Verification of timed circuits with symbolic delays
When time is incorporated in the specification of discrete systems, the complexity of verification grows exponentially. When the temporal behavior is specified with symbols, the ve...
Robert Clarisó, Jordi Cortadella
LCC
1994
213views Algorithms» more  LCC 1994»
13 years 8 months ago
Linear Constraint Query Languages: Expressive Power and Complexity
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
Stéphane Grumbach, Jianwen Su, Christophe T...
HICSS
1998
IEEE
169views Biometrics» more  HICSS 1998»
13 years 8 months ago
A Transmission-Constrained Unit Commitment Method
This paper presents a transmission-constrained unit commitment method using a Lagrangian relaxation approach. Based on a DC power flow model, the transmission constraints are form...
Chung-Li Tseng, Shmuel S. Oren, C. S. Cheng, C.-A....
CONCUR
2000
Springer
13 years 9 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
13 years 9 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
ISIPTA
2003
IEEE
13 years 9 months ago
Exploring Imprecise Probability Assessments Based on Linear Constraints
For many problems there is only suf£cient prior information for a Bayesian decision maker to identify a class of possible prior distributions. In such cases it is of interest to ...
Radu Lazar, Glen Meeden
ECAI
2004
Springer
13 years 10 months ago
Uncertain Linear Constraints
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying many AI uncertainty for...
Nic Wilson
ECAI
2004
Springer
13 years 10 months ago
Geographic Information Revision Based on Constraints
Abstract. Information usually has many sources and is often incomplete and / or uncertain, this leads to many inconsistencies. Revision is the operation which consists in identifyi...
Mahat Khelfallah, Belaid Benhamou
ECSQARU
2005
Springer
13 years 10 months ago
A Local Fusion Method of Temporal Information
Information often comes from different sources and merging these sources usually leads to apparition of inconsistencies. Fusion is the operation which consists in restoring the co...
Mahat Khelfallah, Belaid Benhamou
CP
2005
Springer
13 years 10 months ago
From Linear Relaxations to Global Constraint Propagation
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...
Claude-Guy Quimper, Alejandro López-Ortiz