2137 search results - page 346 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
160
click to vote
ISPAN
2002
IEEE
15 years 7 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
137
click to vote
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
124
click to vote
DIALM
2003
ACM
15 years 7 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
112
click to vote
INFOCOM
2010
IEEE
15 years 29 days ago
2010
IEEE
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...
119
click to vote
ICMLA
2008
15 years 3 months ago
2008
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...