4894 search results - page 799 / 979 » Choices |
173
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
159
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
181
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
268
click to vote
VLDB
2004
ACM
16 years 6 months ago
2004
ACM
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
253
click to vote
VLDB
2005
ACM
16 years 6 months ago
2005
ACM
The traditional model of bench (wet) chemistry in many life sciences domain is today actively complimented by computer-based discoveries utilizing the growing number of online data...