Sciweavers

17789 search results - page 3463 / 3558
» Exceptional Use Cases
Sort
View
APPROX
2008
Springer
72views Algorithms» more  APPROX 2008»
14 years 5 days ago
Increasing the Output Length of Zero-Error Dispersers
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
Ariel Gabizon, Ronen Shaltiel
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
14 years 5 days ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
ASWC
2008
Springer
14 years 4 days ago
ROC: A Method for Proto-ontology Construction by Domain Experts
Abstract. Ontology construction is a labour-intensive and costly process. Even though many formal and semi-formal vocabularies are available, creating an ontology for a specific ap...
Nicole J. J. P. Koenderink, Mark van Assem, J. Lar...
ATAL
2008
Springer
14 years 4 days ago
Simultaneously modeling humans' preferences and their beliefs about others' preferences
In strategic multiagent decision making, it is often the case that a strategic reasoner must hold beliefs about other agents and use these beliefs to inform its decision making. T...
Sevan G. Ficici, Avi Pfeffer
ATAL
2008
Springer
14 years 4 days ago
Solving two-person zero-sum repeated games of incomplete information
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
Andrew Gilpin, Tuomas Sandholm
« Prev « First page 3463 / 3558 Last » Next »