Sciweavers

1615 search results - page 146 / 323
» Adaptive programming in JAsCo
Sort
View
128
Voted
JUCS
2008
117views more  JUCS 2008»
15 years 3 months ago
Eliminating Cycles in Weak Tables
: Weak References constitute an elegant mechanism for an application to interact with its garbage collector. In most of its typical uses, weak references are used through weak tabl...
Alexandra Barros, Roberto Ierusalimschy
137
Voted
CGO
2010
IEEE
15 years 1 months ago
On improving heap memory layout by dynamic pool allocation
Dynamic memory allocation is widely used in modern programs. General-purpose heap allocators often focus more on reducing their run-time overhead and memory space utilization, but...
Zhenjiang Wang, Chenggang Wu, Pen-Chung Yew
TSP
2010
14 years 10 months ago
Code design for radar STAP via optimization theory
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
112
Voted
WWW
2008
ACM
16 years 4 months ago
Non-intrusive monitoring and service adaptation for WS-BPEL
Web service processes currently lack monitoring and dynamic (runtime) adaptation mechanisms. In highly dynamic processes, services frequently need to be exchanged due to a variety...
Oliver Moser, Florian Rosenberg, Schahram Dustdar
121
Voted
ICWS
2009
IEEE
16 years 24 days ago
A Plug-in Architecture for Self-Adaptive Web Service Compositions
Abstract—Several approaches have been proposed to introduce self-management capabilities for web service compositions. However, most of these works are limited as they are not ex...
Anis Charfi, Tom Dinkelaker, Mira Mezini