Sciweavers

779 search results - page 105 / 156
» A graph polynomial for independent sets of bipartite graphs
Sort
View
ICPPW
2006
IEEE
15 years 3 months ago
Multidimensional Dataflow-based Parallelization for Multimedia Instruction Set Extensions
In retargeting loop-based code for multimedia instruction set extensions, a critical issue is that vector data types of mixed precision within a loop body complicate the paralleli...
Lewis B. Baumstark Jr., Linda M. Wills
CAV
2008
Springer
96views Hardware» more  CAV 2008»
14 years 11 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
WINE
2009
Springer
171views Economy» more  WINE 2009»
15 years 4 months ago
The Impact of Social Ignorance on Weighted Congestion Games
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kap...
CATS
2008
14 years 11 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
IPCO
2008
91views Optimization» more  IPCO 2008»
14 years 11 months ago
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....