Sciweavers

2370 search results - page 136 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
WADS
2009
Springer
202views Algorithms» more  WADS 2009»
15 years 4 months ago
Minimal Locked Trees
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties...
Brad Ballinger, David Charlton, Erik D. Demaine, M...
IEEEPACT
2007
IEEE
15 years 4 months ago
Call-chain Software Instruction Prefetching in J2EE Server Applications
We present a detailed characterization of instruction cache performance for IBM’s J2EE-enabled web server, WebSphere Application Server (WAS). When running two J2EE benchmarks o...
Priya Nagpurkar, Harold W. Cain, Mauricio J. Serra...
VALUETOOLS
2006
ACM
113views Hardware» more  VALUETOOLS 2006»
15 years 3 months ago
Load prediction models in web-based systems
Run-time management of modern Web-based services requires the integration of several algorithms and mechanisms for job dispatching, load sharing, admission control, overload detec...
Mauro Andreolini, Sara Casolari
COMPSAC
2009
IEEE
15 years 1 months ago
Hot Set Identification for Social Network Applications
Several operations of Web-based applications are optimized with respect to the set of resources that will receive the majority of requests in the near future, namely the hot set. U...
Claudia Canali, Michele Colajanni, Riccardo Lancel...
CLA
2004
14 years 11 months ago
Planarity of Additively Drawn Concept Lattices
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
Christian Zschalig