Sciweavers

8294 search results - page 1033 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
173
Voted
ICRA
2002
IEEE
86views Robotics» more  ICRA 2002»
16 years 6 days ago
Robust Active Stereo Calibration
We present a calibration procedure to determine the kinematic parameters of an active stereo system in a robot-centric frame of reference. Our goal was to obtain a solution of suļ...
Jeremiah J. Neubert, Nicola J. Ferrier
AAAI
2007
15 years 9 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel
AIIDE
2008
15 years 9 months ago
Stochastic Plan Optimization in Real-Time Strategy Games
We present a domain independent off-line adaptation technique called Stochastic Plan Optimization for finding and improving plans in real-time strategy games. Our method is based ...
Andrew Trusty, Santiago Ontañón, Ash...
ATAL
2008
Springer
15 years 9 months ago
Decommitment in multi-resource negotiation
This paper presents the design and implementation of negotiation agents that negotiate with other entities for acquiring multiple resources. In our approach, agents utilize a time...
Bo An, Victor R. Lesser, Kwang Mong Sim
242
Voted
IPCO
2008
221views Optimization» more  IPCO 2008»
15 years 8 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
« Prev « First page 1033 / 1659 Last » Next »