Sciweavers

8655 search results - page 1005 / 1731
» Challenges for Trusted Computing
Sort
View
CCGRID
2008
IEEE
15 years 9 months ago
A Probabilistic Model to Analyse Workflow Performance on Production Grids
Production grids are complex and highly variable systems whose behavior is not well understood and difficult to anticipate. The goal of this study is to estimate the impact of the ...
Tristan Glatard, Johan Montagnat, Xavier Pennec
ASSETS
2005
ACM
15 years 9 months ago
Toward Goldilocks' pointing device: determining a "just right" gain setting for users with physical impairments
We designed and evaluated an agent that recommends a pointing device gain for a given user, with mixed success. 12 participants with physical impairments used the Input Device Age...
Heidi Horstmann Koester, Edmund F. LoPresti, Richa...
ISMB
1993
15 years 8 months ago
Minimizing Complexity in Cellular Automata Models of Self-Replication
Understanding self-replication from an information processing perspective is important because, amongother things, it can shed light on molecular mechanismsof biological reproduct...
James A. Reggia, Hui-Hsien Chou, Steven L. Armentr...
TIP
2008
144views more  TIP 2008»
15 years 7 months ago
Incremental Refinement of Image Salient-Point Detection
Low-level image analysis systems typically detect "points of interest", i.e., areas of natural images that contain corners or edges. Most of the robust and computationall...
Yiannis Andreopoulos, Ioannis Patras
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
15 years 6 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
« Prev « First page 1005 / 1731 Last » Next »