Sciweavers

545 search results - page 39 / 109
» Global Register Partitioning
Sort
View
JASIS
2011
103views more  JASIS 2011»
13 years 3 months ago
Using global mapping to create more accurate document-level maps of research fields
We describe two general approaches to creating document-level maps of science. To create a local map one defines and directly maps a sample of data, such as all literature publish...
Richard Klavans, Kevin W. Boyack
ICCAD
2006
IEEE
304views Hardware» more  ICCAD 2006»
14 years 5 months ago
Trunk decomposition based global routing optimization
We present global routing optimization methods which are not based on rip-up and re-route framework. In particular, the routing optimization is based on trunk decomposition [13] o...
Devang Jariwala, John Lillis
IPPS
2006
IEEE
14 years 2 months ago
An extensible global address space framework with decoupled task and data abstractions
ions Sriram Krishnamoorthy½ Umit Catalyurek¾ Jarek Nieplocha¿ Atanas Rountev½ P. Sadayappan½ ½ Dept. of Computer Science and Engineering, ¾ Dept. of Biomedical Informatics T...
Sriram Krishnamoorthy, Ümit V. Çataly&...
ECCV
2008
Springer
14 years 7 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
RTSS
2005
IEEE
14 years 2 months ago
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
UmaMaheswari C. Devi, James H. Anderson