Sciweavers

1242 search results - page 108 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
15 years 10 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
MOBIHOC
2007
ACM
15 years 9 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
IUI
2006
ACM
15 years 4 months ago
Activity-oriented context-aware adaptation assisting mobile geo-spatial activities
Human geospatial activities often involves the use of geographic information in mobile environment where the context of technology use is dynamic, complex, and unstable, creating ...
Guoray Cai, Yinkun Xue
FOCS
2004
IEEE
15 years 1 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 1 months ago
The baldwin effect in developing neural networks
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
Keith L. Downing