Sciweavers

2199 search results - page 255 / 440
» Orientation Interpolation and Applications
Sort
View
CIE
2008
Springer
15 years 8 months ago
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
Marcin Jurdzinski, Rahul Savani
CCCG
2010
15 years 8 months ago
I/O efficient path traversal in well-shaped tetrahedral meshes
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ l...
Craig Dillabaugh
IPCO
2007
81views Optimization» more  IPCO 2007»
15 years 8 months ago
Matching Problems in Polymatroids Without Double Circuits
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
Márton Makai, Gyula Pap, Jácint Szab...
AIPS
2006
15 years 8 months ago
Bringing Users and Planning Technology Together. Experiences in SIADEX
This work describes the solutions adopted to the problems tackled during the development of SIADEX, an intelligent planning and scheduling application where users play a central r...
Juan Fernández-Olivares, Luis A. Castillo, ...
FLAIRS
2004
15 years 8 months ago
Using Student Explanations as Models for Adapting Tutorial Dialogue
We describe a dialogue management approach that adapts dialogue strategies to a changing user model under the constraint that the approach be able to scale up rapidly for intellig...
Pamela W. Jordan