4469 search results - page 529 / 894 » Dynamic Program Slicing |
194
click to vote
ICSE
2010
IEEE-ACM
15 years 5 months ago
2010
IEEE-ACM
To stay aware of relevant information and avoid productivity loss, a developer has to continuously read through new incoming information. Our approach supports the integration of ...
180
click to vote
KI
2010
Springer
15 years 4 months ago
2010
Springer
A robot that is to assist humans in everyday activities should not only be efficient, but also choose actions that are understandable for a person. One characteristic of human task...
216
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
170
click to vote
JDA
2010
15 years 1 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
186
click to vote
ICALP
2003
Springer
16 years 18 hour ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...