Sciweavers

1686 search results - page 219 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ICASSP
2010
IEEE
15 years 4 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
ICS
2005
Tsinghua U.
15 years 9 months ago
Low-power, low-complexity instruction issue using compiler assistance
In an out-of-order issue processor, instructions are dynamically reordered and issued to function units in their dataready order rather than their original program order to achiev...
Madhavi Gopal Valluri, Lizy Kurian John, Kathryn S...
LCTRTS
2000
Springer
15 years 7 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
CHI
2008
ACM
16 years 4 months ago
Picbreeder: evolving pictures collaboratively online
Picbreeder is an online service that allows users to collaboratively evolve images. Like in other Interactive Evolutionary Computation (IEC) programs, users evolve images in Picbr...
Jimmy Secretan, Nicholas Beato
IPPS
2006
IEEE
15 years 10 months ago
Tree-based overlay networks for scalable applications
The increasing availability of high-performance computing systems with thousands, tens of thousands, and even hundreds of thousands of computational nodes is driving the demand fo...
Dorian C. Arnold, G. D. Pack, Barton P. Miller