1272 search results - page 64 / 255 » The Set Cover with Pairs Problem |
97
Voted
COCOON
2003
Springer
15 years 6 months ago
2003
Springer
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...
144
click to vote
ISSS
1996
IEEE
15 years 5 months ago
1996
IEEE
The application range of the embedded computing is going to cover the majority of the market products spanning from consumer electronic, automotive, telecom and process control. F...
122
click to vote
IPCO
2007
15 years 2 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
Answer-set programming (ASP) is a well-acknowledged paradigm for declarative problem solving, yet comparably little effort has been spent on the investigation of methods to support...
122
Voted
KDD
2008
ACM
16 years 1 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...