Sciweavers

1242 search results - page 94 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
LICS
2006
IEEE
15 years 4 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
JCSS
2007
88views more  JCSS 2007»
14 years 10 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...
Denis Xavier Charles
SIVP
2010
118views more  SIVP 2010»
14 years 8 months ago
Self-organization of sensor networks for detection of pervasive faults
Resource aware operation of sensor networks requires adaptive re-organization to dynamically adapt to the operational environment. A complex dynamical system of interacting compone...
Abhishek Srivastav, Asok Ray
ALDT
2009
Springer
162views Algorithms» more  ALDT 2009»
15 years 4 months ago
Compact Preference Representation in Stable Marriage Problems
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
Enrico Pilotto, Francesca Rossi, Kristen Brent Ven...
PPSN
2000
Springer
15 years 1 months ago
Practical Implications of New Results in Conservation of Optimizer Performance
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
Thomas M. English