Sciweavers

9842 search results - page 218 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
MOBIHOC
2007
ACM
14 years 10 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
STACS
1993
Springer
14 years 2 months ago
A First-Order Isomorphism Theorem
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
Eric Allender, José L. Balcázar, Nei...
ECAI
2008
Springer
14 years 16 days ago
Test Generation for Model-Based Diagnosis
This article formalises the dual problem to model-based diagnosis (MBD), i.e., generating tests to isolate multiple simultaneous faults. Using a standard propositional MBD framewo...
Gregory M. Provan
LDVF
2000
102views more  LDVF 2000»
13 years 10 months ago
Imperatives, Commitment and Action: Towards a Constraint-based Model
The aim of this paper is to provide an analysis of the function of imperatives in dialogue. In particular, the focus is on the use of logically complex imperatives (e.g., `Say hel...
Paul Piwek
ALGOSENSORS
2004
Springer
14 years 4 months ago
On the Computational Complexity of Sensor Network Localization
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
James Aspnes, David Kiyoshi Goldenberg, Yang Richa...