Sciweavers

13376 search results - page 187 / 2676
» Problem Solving with
Sort
View
TIT
2008
102views more  TIT 2008»
15 years 3 months ago
Extremal Problems of Information Combining
Abstract--In this paper, we study moments of soft bits of binary-input symmetric-output channels and solve some extremal problems of the moments. We use these results to solve the ...
Yibo Jiang, Alexei E. Ashikhmin, Ralf Koetter, And...
ESWS
2009
Springer
15 years 10 months ago
An Ontology of Resources: Solving the Identity Crisis
The primary goal of the Semantic Web is to use URIs as a universal space to name anything, expanding from using URIs for webpages to URIs for “real objects and imaginary concepts...
Harry Halpin, Valentina Presutti
CLEF
2005
Springer
15 years 9 months ago
20th Century Esfinge (Sphinx) Solving the Riddles at CLEF 2005
Abstract. Esfinge is a general domain Portuguese question answering system. It tries to apply simple techniques to large amounts of text. Esfinge participated last year in the mono...
Luís Costa
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
15 years 8 months ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri
ATAL
2008
Springer
15 years 5 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...