4118 search results - page 466 / 824 » Efficient Algorithms for Airline Problem |
179
click to vote
SIGSOFT
2010
ACM
15 years 4 months ago
2010
ACM
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...
180
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Matrix factorization (MF) models have proved efficient and well scalable for collaborative filtering (CF) problems. Many researchers also present the probabilistic interpretation o...
178
click to vote
CAP
2010
15 years 1 months ago
2010
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...
222
click to vote
TMC
2010
15 years 1 months ago
2010
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
160
click to vote
FUIN
2008
15 years 6 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...