3404 search results - page 184 / 681 » C Programming Tutorial |
NN
2008
Springer
14 years 10 months ago
2008
Springer
This paper presents two k-winners-take-all (k-WTA) networks with discontinuous activation functions. The k-WTA operation is first converted equivalently into linear and quadratic ...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
IIE
2007
14 years 10 months ago
2007
Although there are many high-quality models for program and evaluation planning, these models are often too intensive to be used in situations when time and resources are scarce. A...
PLDI
2012
ACM
13 years 13 days ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
PLDI
2003
ACM
15 years 3 months ago
2003
ACM
The Real-Time Specification for Java (RTSJ) allows a program to create real-time threads with hard real-time constraints. Real-time threads use region-based memory management to ...