Sciweavers

4378 search results - page 678 / 876
» On the Complexity of Ordered Colourings
Sort
View
MP
2002
84views more  MP 2002»
15 years 6 months ago
The volume algorithm revisited: relation with bundle methods
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle methods. When first introduced, VA was presented as a subgradient-like method for solving the ori...
Laura Bahiense, Nelson Maculan, Claudia A. Sagasti...
MTA
2002
195views more  MTA 2002»
15 years 6 months ago
Shot Partitioning Based Recognition of TV Commercials
Digital video applications exploit the intrinsic structure of video sequences. In order to obtain and represent this structure for video annotation and indexing tasks, the main ini...
Juan María Sánchez, Xavier Binefa, J...
NN
1998
Springer
15 years 6 months ago
A tennis serve and upswing learning robot based on bi-directional theory
We experimented on task-level robot learning based on bi-directional theory. The via-point representation was used for ‘learning by watching’. In our previous work, we had a r...
Hiroyuki Miyamoto, Mitsuo Kawato
RAS
1998
145views more  RAS 1998»
15 years 6 months ago
Coordinated path planning for multiple robots
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
Petr Svestka, Mark H. Overmars
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
15 years 6 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...