Sciweavers

4114 search results - page 323 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
SOFSEM
2000
Springer
15 years 10 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
WINE
2010
Springer
164views Economy» more  WINE 2010»
15 years 4 months ago
Incentives in Online Auctions via Linear Programming
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
Niv Buchbinder, Kamal Jain, Mohit Singh
SIGSOFT
2010
ACM
15 years 4 months ago
A trace simplification technique for effective debugging of concurrent programs
Concurrent programs are notoriously difficult to debug. We see two main reasons for this: 1) concurrency bugs are often difficult to reproduce, 2) traces of buggy concurrent execu...
Nicholas Jalbert, Koushik Sen
ICDM
2009
IEEE
188views Data Mining» more  ICDM 2009»
15 years 4 months ago
Binomial Matrix Factorization for Discrete Collaborative Filtering
Matrix factorization (MF) models have proved efficient and well scalable for collaborative filtering (CF) problems. Many researchers also present the probabilistic interpretation o...
Jinlong Wu
CAP
2010
15 years 1 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman