Sciweavers

3221 search results - page 398 / 645
» Termination of Linear Programs
Sort
View
POPL
1996
ACM
15 years 10 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
ICRA
1993
IEEE
118views Robotics» more  ICRA 1993»
15 years 10 months ago
Hip Implant Insertability Analysis: A Medical Instance of the Peg-In-Hole Problem
cavity Recent advan.cesin cementless hip replacement surgery have significantly improved the accuracy of bone cavity preparation and custom implant shape design. With the increased...
Leo Joskowicz, Russell H. Taylor
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 10 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
ICALP
2007
Springer
15 years 10 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
FOSSACS
2006
Springer
15 years 10 months ago
Register Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
Fernando Magno Quintão Pereira, Jens Palsbe...