Sciweavers

2702 search results - page 155 / 541
» constraints 2008
Sort
View
CIE
2008
Springer
15 years 6 months ago
First-Order Model Checking Problems Parameterized by the Model
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
Barnaby Martin
CDC
2008
IEEE
117views Control Systems» more  CDC 2008»
16 years 29 days ago
Simulation-aided reachability and local gain analysis for nonlinear dynamical systems
Abstract— We analyze reachability properties and local input/output gains of systems with polynomial vector fields. Upper bounds for the reachable set and nonlinear system gains...
Weehong Tan, Ufuk Topcu, Peter Seiler, Gary J. Bal...
IPPS
2008
IEEE
16 years 27 days ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
VTC
2008
IEEE
164views Communications» more  VTC 2008»
16 years 26 days ago
Resource Allocation for Downlink Spectrum Sharing in Cognitive Radio Networks
— We consider a resource allocation problem for spectrum sharing in cognitive radio networks. Specifically, we investigate the joint subchannel, rate and power allocation for se...
Patrick Mitran, Long Le, Catherine Rosenberg, Andr...
AI
2008
Springer
15 years 6 months ago
Theoretical analysis of singleton arc consistency and its extensions
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but...
Christian Bessiere, Romuald Debruyne