Sciweavers

1960 search results - page 310 / 392
» The Logic of Large Enough
Sort
View
EAGC
2003
Springer
14 years 3 months ago
Automatic Services Discovery, Monitoring and Visualization of Grid Environments: The MapCenter Approach
The complexity of Grid environments is growing as more projects and applications appear in this quick-evolving domain. Widespread applications are distributed over thousands of com...
Franck Bonnassieux, Robert Harakaly, Pascale Prime...
EUROSYS
2010
ACM
14 years 3 months ago
Residue objects: a challenge to web browser security
A complex software system typically has a large number of objects in the memory, holding references to each other to implement an object model. Deciding when the objects should be...
Shuo Chen, Hong Chen, Manuel Caballero
FUZZY
1997
Springer
166views Fuzzy Logic» more  FUZZY 1997»
14 years 2 months ago
Optimizing Video Signal Processing Algorithms by Evolution Strategies
Today many kinds of postprocessing are used in digital TV receivers or multimedia terminals for video signals to enhance the picture quality. To achieve this the properties of hum...
H. Blume, O. Franzen, M. Schmidt
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
14 years 2 months ago
Optimal latch mapping and retiming within a tree
We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
Joel Grodstein, Eric Lehman, Heather Harkness, Her...
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 2 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman