Sciweavers

810 search results - page 136 / 162
» Solving Time-Dependent Planning Problems
Sort
View
SIGCSE
2010
ACM
175views Education» more  SIGCSE 2010»
14 years 1 months ago
MPCT: media propelled computational thinking
Media-Propelled Computational Thinking (MPCT – pronounced impact) is a course designed to introduce programming in the context of engaging problems in media computation, math, a...
Eric Andrew Freudenthal, Mary K. Roy, Alexandria N...
JAIR
2008
126views more  JAIR 2008»
13 years 7 months ago
Optimal and Approximate Q-value Functions for Decentralized POMDPs
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
Frans A. Oliehoek, Matthijs T. J. Spaan, Nikos A. ...
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
14 years 4 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
CVPR
2010
IEEE
14 years 4 months ago
Surface Extraction from Binary Volumes with Higher-Order Smoothness
A number of 3D shape reconstruction algorithms, in particular 3D image segmentation methods, produce their results in the form of binary volumes, where a binary value indicates whe...
Victor Lempitsky
ICRA
2008
IEEE
144views Robotics» more  ICRA 2008»
14 years 2 months ago
Decentralized mapping of robot-aided sensor networks
— A key problem in deploying sensor networks in real-world applications is that of mapping, i.e. determining the location of each sensor such that subsequent tasks such as tracki...
Joseph Djugash, Sanjiv Singh, Ben Grocholsky