Sciweavers

849 search results - page 77 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
14 years 1 months ago
Matching Polyhedral Terrains Using Overlays of Envelopes
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Vladlen Koltun, Carola Wenk
ICRA
2007
IEEE
89views Robotics» more  ICRA 2007»
14 years 2 months ago
Probabilistic Strategies for Pursuit in Cluttered Environments with Multiple Robots
Abstract— In this paper, we describe a method for coordinating multiple robots in a pursuit-evasion domain. We examine the problem of multiple robotic pursuers attempting to loca...
Geoffrey Hollinger, Athanasios Kehagias, Sanjiv Si...
EUROCAST
2007
Springer
126views Hardware» more  EUROCAST 2007»
14 years 2 months ago
Determining Orbital Elements of Extrasolar Planets by Evolution Strategies
After the detection of the first extrasolar planet (exoplanet) more than one decade ago we currently know about more than 200 planets around other stars and there are about twenty...
Andreas M. Chwatal, Günther R. Raidl
ICTAI
2005
IEEE
14 years 1 months ago
Subgoal Ordering and Granularity Control for Incremental Planning
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
Chih-Wei Hsu, Yixin Chen
ICASSP
2011
IEEE
12 years 11 months ago
Probabilistic SINR constrained robust transmit beamforming: A Bernstein-type inequality based conservative approach
Recently, robust transmit beamforming has drawn considerable attention because it can provide guaranteed receiver performance in the presence of channel state information (CSI) er...
Kun-Yu Wang, Tsung-Hui Chang, Wing-Kin Ma, Anthony...