Sciweavers

4432 search results - page 455 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
GECCO
2011
Springer
232views Optimization» more  GECCO 2011»
14 years 7 months ago
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
AI
2010
Springer
15 years 4 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
PLDI
2012
ACM
13 years 6 months ago
Fast and precise hybrid type inference for JavaScript
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
Brian Hackett, Shu-yu Guo
CVPR
2012
IEEE
13 years 6 months ago
We are not contortionists: Coupled adaptive learning for head and body orientation estimation in surveillance video
In this paper, we deal with the estimation of body and head poses (i.e orientations) in surveillance videos, and we make three main contributions. First, we address this issue as ...
Cheng Chen, Jean-Marc Odobez
CORR
2010
Springer
160views Education» more  CORR 2010»
15 years 29 days ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely