101 search results - page 13 / 21 » An Efficient Algorithm for Solving the Dyck-CFL Reachability... |
ATAL
2009
Springer
13 years 8 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
Reliable transmission of video over wireless networks must address the limited bandwidth and the possibility of loss. When the bandwidth is insufficient on a single channel, the v...
C3S2E
2010
ACM
13 years 8 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...