5316 search results - page 151 / 1064 » Which Search Problems Are Random |
135
Voted
CPAIOR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...
127
click to vote
ISPASS
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper proposes a specialized memory structure called CA-RAM (Content Addressable Random Access Memory) to accelerate search operations present in many important real-world ap...
108
Voted
FLAIRS
2008
15 years 5 months ago
2008
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
116
Voted
DKE
2008
15 years 3 months ago
2008
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
134
Voted
ASIAMS
2007
IEEE
15 years 10 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...