Sciweavers

13603 search results - page 208 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
PVLDB
2008
103views more  PVLDB 2008»
15 years 6 months ago
A request-routing framework for SOA-based enterprise computing
Enterprises may use a service-oriented architecture (SOA) to provide a streamlined interface to their business processes. To scale up the system, each tier in a composite service ...
Thomas Phan, Wen-Syan Li
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
14 years 10 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 9 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
CCGRID
2006
IEEE
15 years 10 months ago
IPMI-based Efficient Notification Framework for Large Scale Cluster Computing
The demand for an efficient fault tolerance system has led to the development of complex monitoring infrastructure, which in turn has created an overwhelming task of data and even...
Chokchai Leangsuksun, Tirumala Rao, Anand Tikoteka...
GECCO
2008
Springer
149views Optimization» more  GECCO 2008»
15 years 7 months ago
Real-time imitation-based adaptation of gaming behaviour in modern computer games
In the course of the recent complexification and sophistication of commercial computer games, the creation of competitive artificial players that are able to behave intelligentl...
Steffen Priesterjahn, Alexander Weimer, Markus Ebe...