Sciweavers

11129 search results - page 425 / 2226
» Modeling Search Computing Applications
Sort
View
178
Voted
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
16 years 25 days ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
188
Voted
SBBD
2004
119views Database» more  SBBD 2004»
15 years 8 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
189
Voted
EMMCVPR
1999
Springer
15 years 11 months ago
Bayesian Models for Finding and Grouping Junctions
In this paper, we propose two Bayesian methods for detecting and grouping junctions. Our junction detection method evolves from the Kona approach, and it is based on a competitive ...
Miguel Cazorla, Francisco Escolano, Domingo Gallar...
188
Voted
ICCS
2000
Springer
15 years 10 months ago
A Conceptual Graph Model for W3C Resource Description Framework
With the aim of building a "Semantic Web", the content of the documents must be explicitly represented through metadata in order to enable contents-guided search. Our app...
Olivier Corby, Rose Dieng, Cédric Hé...
175
Voted
AAAI
2006
15 years 8 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer