Sciweavers

995 search results - page 95 / 199
» Wire-speed total order
Sort
View
SAC
2005
ACM
14 years 2 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
FATES
2005
Springer
14 years 2 months ago
Testing Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach
The global testing problem studied in this paper is to seek a definite answer to whether a system of concurrent black-boxes has an observable behavior in a given finite (but cou...
Gaoyan Xie, Zhe Dang
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 2 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
DEXAW
2003
IEEE
76views Database» more  DEXAW 2003»
14 years 2 months ago
Today's DBMSs: How autonomic are they?
Database Management Systems (DBMSs) are complex systems whose manageability is increasingly becoming a real concern. Realizing that expert Database Administrators (DBAs) are scarc...
Said Elnaffar, Wendy Powley, Darcy G. Benoit, T. P...
ICDCS
2003
IEEE
14 years 2 months ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande