Sciweavers

3356 search results - page 487 / 672
» Determining Consensus Numbers
Sort
View
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
13 years 11 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
AAAI
1990
13 years 11 months ago
Practical Temporal Projection
Temporal projection-predicting future states of a changing world-has been studied mainly as a formal problem. Researchers have been concerned with getting the concepts of causalit...
Steve Hanks
WCE
2007
13 years 11 months ago
An Intelligent Conversational Agent Approach to Extracting Queries from Natural Language
—This paper is concerned with the application of a conversational agent and expert system to provide a natural language interface to a database. Typically, natural language datab...
Karen Pudner, Keeley A. Crockett, Zuhair Bandar
ATAL
2010
Springer
13 years 11 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
ATAL
2010
Springer
13 years 11 months ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish