1310 search results - page 213 / 262 » Progressive Optimization in Action |
188
Voted
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
191
Voted
CIKM
2011
Springer
14 years 6 months ago
2011
Springer
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
274
click to vote
ICFP
2009
ACM
16 years 6 months ago
2009
ACM
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...
143
click to vote
ATAL
2007
Springer
16 years 9 days ago
2007
Springer
Classically, an approach to the multiagent policy learning supposed that the agents, via interactions and/or by using preliminary knowledge about the reward functions of all playe...
149
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— One of TCP’s critical tasks is to determine which packets are lost in the network, as a basis for control actions (flow control and packet retransmission). Modern TCP implem...