Sciweavers

442 search results - page 42 / 89
» Exploration in computer games - a new starting point
Sort
View
TCS
2008
14 years 11 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
Christine Cheng, Eric McDermid, Ichiro Suzuki
NA
2010
104views more  NA 2010»
14 years 6 months ago
New interpolants for asymptotically correct defect control of BVODEs
The defect of a continuous approximate solution to an ODE is the amount by which that approximation fails to satisfy the ODE. A number of studies have explored the use of asymptot...
Wayne H. Enright, P. H. Muir
LPAR
2004
Springer
15 years 5 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
ACL
1994
15 years 1 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
CVPR
2011
IEEE
14 years 3 months ago
Topologically-Robust 3D Shape Matching Based on Diffusion Geometry and Seed Growing
3D Shape matching is an important problem in computer vision. One of the major difficulties in finding dense correspondences between 3D shapes is related to the topological disc...
Avinash Sharma, Radu Horaud, Jan Cech, Edmond Boye...