1615 search results - page 166 / 323 » Adaptive programming in JAsCo |
142
Voted
ESAW
2000
Springer
15 years 7 months ago
2000
Springer
The design and development of Internet applications can take advantage of a paradigm based on autonomous and mobile agents. However, agent mobility introduces peculiar coordinatio...
133
Voted
ISCA
1998
IEEE
15 years 7 months ago
1998
IEEE
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
129
Voted
IWMM
2000
Springer
15 years 7 months ago
2000
Springer
Java uses garbage collection (GC) for the automatic reclamation of computer memory no longer required by a running application. GC implementations for Java Virtual Machines (JVM) ...
118
click to vote
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
150
click to vote
CASES
2008
ACM
15 years 5 months ago
2008
ACM
Java applications rely on Just-In-Time (JIT) compilers or adaptive compilers to generate and optimize binary code at runtime to boost performance. In conventional Java Virtual Mac...