Sciweavers

4940 search results - page 416 / 988
» On the Complexity of Universal Programs
Sort
View
CAV
2008
Springer
96views Hardware» more  CAV 2008»
15 years 8 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
183
Voted
ICASSP
2010
IEEE
15 years 7 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
IJON
2006
127views more  IJON 2006»
15 years 6 months ago
Evolved neural networks based on cellular automata for sensory-motor controller
Constructing the controller of a mobile robot has several issues to be addressed: how to automate behavior generation procedure, how to insert available domain knowledge effective...
Kyung-Joong Kim, Sung-Bae Cho
TOPLAS
2002
89views more  TOPLAS 2002»
15 years 6 months ago
Efficient and precise array access analysis
A number of existing compiler techniques hinge on the analysis of array accesses in the program. The most important task in array access analysis is to collect the information abo...
Yunheung Paek, Jay Hoeflinger, David A. Padua

Book
1575views
17 years 2 months ago
Bison - The Yacc-compatible Parser Generator
"Bison is a general-purpose parser generator that converts an annotated context-free grammar into an LALR(1) or GLR parser for that grammar. Once you are proficient with Biso...
Charles Donnelly and Richard Stallman