Sciweavers

614 search results - page 21 / 123
» Computational Complexity of Multi-way, Dataflow Constraint P...
Sort
View
ICS
2010
Tsinghua U.
15 years 10 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
MST
2010
140views more  MST 2010»
14 years 11 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
16 years 1 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 6 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
INFOCOM
2012
IEEE
13 years 3 months ago
Resource allocation for heterogeneous multiuser OFDM-based cognitive radio networks with imperfect spectrum sensing
—In this paper we study the resource allocation in OFDM-based cognitive radio (CR) networks, under the consideration of many practical limitations such as imperfect spectrum sens...
Shaowei Wang, Zhi-Hua Zhou, Mengyao Ge, Chonggang ...