Sciweavers

13603 search results - page 103 / 2721
» On the Complexity of Computing Treelength
Sort
View
ALIFE
1998
13 years 9 months ago
Computational Models for the Formation of Protocell Structures
There have been various attempts to simulate the self-assembly process of lipid aggregates by computers. However, due to the computationally complex nature of the problem, previou...
Linglan Edwards, Yun Peng, James A. Reggia
PVLDB
2008
103views more  PVLDB 2008»
13 years 8 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»
13 years 22 days 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»
13 years 1 days 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
SP
2002
IEEE
165views Security Privacy» more  SP 2002»
13 years 9 months ago
NINJA: Java for high performance numerical computing
When Java was first introduced, there was a perception that its many benefits came at a significant performance cost. In the particularly performance-sensitive field of numerical ...
José E. Moreira, Samuel P. Midkiff, Manish ...