Sciweavers

2354 search results - page 160 / 471
» Assignment Problems
Sort
View
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 10 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
137
Voted
ECRTS
2003
IEEE
15 years 10 months ago
Resource Partitioning among Real-Time Applications
When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing req...
Giuseppe Lipari, Enrico Bini
EUC
2006
Springer
15 years 8 months ago
Data-Layout Optimization Using Reuse Distance Distribution
As the ever-increasing gap between the speed of processor and the speed of memory has become the cause of one of primary bottlenecks of computer systems, modern architecture system...
Xiong Fu, Yu Zhang, Yiyun Chen
117
Voted
LREC
2008
126views Education» more  LREC 2008»
15 years 6 months ago
Tree Distance and Some Other Variants of Evalb
Some alternatives to the standard evalb measures for parser evaluation are considered, principally the use of a tree-distance measure, which assigns a score to a linearity and anc...
Martin Emms
IJCAI
1993
15 years 6 months ago
Learning of Resource Allocation Strategies for Game Playing
Human chess players exhibit a large variation in the amount of time they allocate for each move. Yet, the problem of devising resource allocation strategies for game playing did n...
Shaul Markovitch, Yaron Sella