The evolution of distributed applications to reflect structural changes or to adapt to specific conditions of the run-time environment is a difficult issue especially if continuou...
Noel De Palma, Sara Bouchenak, Slim Ben Atallah, D...
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
Louis I. Steinberg, J. Storrs Hall, Brian D. Davis...
Compelling synthetic characters must behave in ways that reflect their past experience and thus allow for individual personalization. We therefore need a method that allows charac...
Song-Yee Yoon, Robert C. Burke, Bruce Blumberg, Ge...
The GDA (Global Document Annotation) project proposes a tag set which allows machines to automatically infer the underlying semantic/pragmatic structure of documents. Its objectiv...