Sciweavers

4255 search results - page 558 / 851
» Cover
Sort
View
COCOON
2003
Springer
15 years 12 months ago
Finding Hidden Independent Sets in Interval Graphs
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Therese C. Biedl, Brona Brejová, Erik D. De...
COLT
2003
Springer
15 years 12 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
CONCUR
2003
Springer
15 years 12 months ago
Comparative Branching-Time Semantics
d Abstract) Christel Baier1 , Holger Hermanns2,3 , Joost-Pieter Katoen2 , and Verena Wolf1 1 Institut f¨ur Informatik I, University of Bonn R¨omerstraße 164, D-53117 Bonn, Germa...
Christel Baier, Holger Hermanns, Joost-Pieter Kato...
CP
2003
Springer
15 years 12 months ago
CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
Alessio Guerri, Michela Milano
164
Voted
ECOOPW
2003
Springer
15 years 12 months ago
Advancing the State of the Art in Run-Time Inspection
levels of abstraction. Lacking well-established technologies and models for representing and accessing program dynamics, tools must use ad-hoc mechanisms. This limits reuse and int...
Robert E. Filman, Katharina Mehner, Michael Haupt