Sciweavers

2681 search results - page 90 / 537
» Problem F
Sort
View
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
13 years 11 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
DM
2010
140views more  DM 2010»
13 years 10 months ago
Online Ramsey games for triangles in random graphs
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
József Balogh, Jane Butterfield
IROS
2008
IEEE
93views Robotics» more  IROS 2008»
14 years 4 months ago
Adaptive motion planning for humanoid robots
— Motion planning for robots with many degrees of freedom (DoF) is a generally unsolved problem in the robotics context. In this work an approach for trajectory planning is prese...
Niko Vahrenkamp, Christian Scheurer, Tamim Asfour,...
ECAI
2008
Springer
13 years 12 months ago
Heuristics for Planning with Action Costs Revisited
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...
Emil Keyder, Hector Geffner
LICS
2006
IEEE
14 years 4 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson