2957 search results - page 243 / 592 » The Complexity of Polynomial-Time Approximation |
167
click to vote
GLVLSI
2007
IEEE
16 years 29 days ago
2007
IEEE
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
179
click to vote
CP
2007
Springer
16 years 24 days ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
159
click to vote
INFOCOM
2006
IEEE
16 years 20 days ago
2006
IEEE
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
164
click to vote
RTCSA
2006
IEEE
16 years 19 days ago
2006
IEEE
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
172
click to vote
SIGECOM
2006
ACM
16 years 17 days ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...