Sciweavers

3473 search results - page 200 / 695
» Aspect-Oriented Programming with C
Sort
View
NN
2008
Springer
15 years 4 months ago
Two k-winners-take-all networks with discontinuous activation functions
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 ...
Qingshan Liu, Jun Wang
IFIP
2004
Springer
15 years 9 months ago
Solving Packing Problem with Weaker Block Solvers
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...
Hu Zhang
IIE
2007
75views more  IIE 2007»
15 years 4 months ago
Program and Evaluation Planning Light: Planning in the Real World
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...
Justus J. Randolph, Pasi J. Eronen
PLDI
2003
ACM
15 years 9 months ago
Ownership types for safe region-based memory management in real-time Java
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 ...
Chandrasekhar Boyapati, Alexandru Salcianu, Willia...
PLDI
2009
ACM
16 years 5 months ago
Automatic generation of library bindings using static analysis
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
Tristan Ravitch, Steve Jackson, Eric Aderhold, Ben...