Sciweavers

2664 search results - page 376 / 533
» Theory by Process
Sort
View
CIE
2007
Springer
16 years 21 days ago
From Logic to Physics: How the Meaning of Computation Changed over Time
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
Itamar Pitowsky
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
16 years 20 days ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
KBSE
2005
IEEE
16 years 3 days ago
Automated test generation for engineering applications
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditio...
Songtao Xia, Ben Di Vito, César Muño...
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
16 years 2 days ago
Classifying scheduling policies with respect to higher moments of conditional response time
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
Adam Wierman, Mor Harchol-Balter
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
16 years 2 days ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami