Sciweavers

3913 search results - page 285 / 783
» complexity 2006
Sort
View
ANNALS
2006
63views more  ANNALS 2006»
15 years 6 months ago
The Virtual Life of ENIAC: Simulating the Operation of the First Electronic Computer
This paper describes an interactive simulation of the Electronical Numerical Integrator and Computer (ENIAC). With the simulator, the user can wire up complex configurations of th...
Till Zoppke, Raúl Rojas
CAGD
2006
90views more  CAGD 2006»
15 years 6 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
Oleg Davydov, Rossana Morandi, Alessandra Sestini
CONCURRENCY
2006
92views more  CONCURRENCY 2006»
15 years 6 months ago
What makes workflows work in an opportunistic environment?
In this paper, we examine the issues of workflow mapping and execution in opportunistic environments such as the grid. As applications become ever more complex, the process of cho...
Ewa Deelman, Tevfik Kosar, Carl Kesselman, Miron L...
COR
2006
80views more  COR 2006»
15 years 6 months ago
Multiple crossdocks with inventory and time windows
Crossdocking studies have mostly been concerned with the physical layout of a crossdock or on a single crossdock. In this work, we study a network of crossdocks taking into consid...
Ping Chen, Yunsong Guo, Andrew Lim, Brian Rodrigue...
141
Voted
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Longest Common Pattern between two Permutations
In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm...
Dominique Rossin, Mathilde Bouvel