Sciweavers

2412 search results - page 40 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
13 years 10 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
STACS
2001
Springer
14 years 2 months ago
Generalized Langton's Ant: Dynamical Behavior and Complexity
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
Anahí Gajardo, Eric Goles Ch., André...
INFOCOM
2006
IEEE
14 years 3 months ago
Constant-Complexity Models for Wireless Channels
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
Syed A. Khayam, Hayder Radha
INFOCOM
2012
IEEE
12 years 10 days ago
Maximizing system throughput by cooperative sensing in Cognitive Radio Networks
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...
Shuang Li, Zizhan Zheng, Eylem Ekici, Ness B. Shro...
IPL
2008
86views more  IPL 2008»
13 years 10 months ago
A more efficient algorithm for perfect sorting by reversals
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
Sèverine Bérard, Cedric Chauve, Chri...