21324 search results - page 3890 / 4265 » Making the case for computing |
165
click to vote
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
143
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
119
click to vote
ACMSE
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we propose a routing protocol that is based on securing the routing information from unauthorized users. Even though routing protocols of this category are already ...
127
click to vote
ACMSE
2004
ACM
15 years 9 months ago
2004
ACM
This paper presents a specification-driven approach to test automation for GUI-based JAVA programs as an alternative to the use of capture/replay. The NetBeans Jemmy library provi...
152
click to vote
SAC
2004
ACM
15 years 9 months ago
2004
ACM
In this paper we present an approach for developing adaptable software applications. The problem we are facing is that of a (possibly mobile) user who wants to download and execut...