8413 search results - page 227 / 1683 » Ordering Problem Subgoals |
122
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
137
click to vote
BROADNETS
2006
IEEE
15 years 2 months ago
2006
IEEE
Routing protocols developed for ad hoc wireless networks use broadcast transmission to either discover a route or disseminate information. More specifically, reactive routing proto...
136
click to vote
BPSC
2009
15 years 1 months ago
2009
Abstract: In this paper we present our ideas to apply constraint satisfaction on business processes. We propose a multi-level constraint satisfaction approach to handle t levels of...
112
click to vote
CN
2010
15 years 26 days ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
SIAMSC
2008
15 years 21 days ago
2008
We present a compact discontinuous Galerkin (CDG) method for an elliptic model problem. The problem is first cast as a system of first order equations by introducing the gradient o...