Sciweavers

562 search results - page 54 / 113
» A case study in web search using TREC algorithms
Sort
View
IWPEC
2009
Springer
15 years 6 months ago
Stable Assignment with Couples: Parameterized Complexity and Local Search
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
Dániel Marx, Ildikó Schlotter
SOFSEM
2000
Springer
15 years 3 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
PODS
2003
ACM
157views Database» more  PODS 2003»
16 years 7 hour ago
Algorithms for data migration with cloning
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high demand storage servers are used as web servers, or multimedia servers...
Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
HT
2007
ACM
15 years 3 months ago
Semport: a personalized semantic portal
This paper presents an ontology-based semantic portal, SEMPort, which aims to support both content providers and the users of the portal during providing information, browsing and...
Melike Sah, Wendy Hall, Nicholas Gibbins, David De...
AI
2002
Springer
14 years 11 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm