Sciweavers

531 search results - page 74 / 107
» A Better Algorithm for Random k-SAT
Sort
View
TIT
2010
136views Education» more  TIT 2010»
13 years 3 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
AAAI
1994
13 years 10 months ago
Control Strategies for a Stochastic Planner
We present new algorithms for local planning over Markov decision processes. The base-level algorithm possesses several interesting features for control of computation, based on s...
Jonathan Tash, Stuart J. Russell
IPL
2006
89views more  IPL 2006»
13 years 9 months ago
Adaptive general perfectly periodic scheduling
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known...
Shailesh Patil, Vijay K. Garg
ICC
2007
IEEE
177views Communications» more  ICC 2007»
14 years 3 months ago
Intelligent Gateways Placement for Reduced Data Latency in Wireless Sensor Networks
— Many applications of wireless sensor networks (WSNs) have emerged over the last few years. In such networks resource-constrained sensor nodes are deployed to probe their surrou...
Waleed A. Youssef, Mohamed F. Younis
ICSM
2006
IEEE
14 years 3 months ago
Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahda...