1095 search results - page 180 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
CCGRID
2005
IEEE
15 years 3 months ago
2005
IEEE
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
JCIT
2008
14 years 9 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
SWAT
1998
Springer
15 years 2 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
115
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
104
click to vote
IIWAS
2008
14 years 11 months ago
2008
Supply chains have evolved to web-applications that tap on the power of internet to expand their networks online. Recently some research attention is focused on make-to-order supp...