Sciweavers

10996 search results - page 1994 / 2200
» Future Directions in Computing
Sort
View
AAAI
2000
13 years 10 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 10 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
UAI
2000
13 years 10 months ago
Being Bayesian about Network Structure
In many domains, we are interested in analyzing the structure of the underlying distribution, e.g., whether one variable is a direct parent of the other. Bayesian model selection a...
Nir Friedman, Daphne Koller
3DOR
2009
13 years 10 months ago
A 3D Shape Benchmark for Retrieval and Automatic Classification of Architectural Data
When drafting new buildings, architects make intensive use of existing 3D models including building elements, furnishing, and environment elements. These models are either directl...
Raoul Wessel, Ina Blümel, Reinhard Klein
ATAL
2010
Springer
13 years 10 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
« Prev « First page 1994 / 2200 Last » Next »