1201 search results - page 228 / 241 » Linear Probing and Graphs |
141
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
150
click to vote
TACAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
153
click to vote
ASAP
2003
IEEE
15 years 10 months ago
2003
IEEE
At the Leiden Embedded Research Center, we are developing a compiler called Compaan that automatically translates signal processing applications written in Matlab into Kahn Proces...
149
click to vote
ILP
2003
Springer
15 years 10 months ago
2003
Springer
In many data mining tools that support regression tasks, training data are stored in a single table containing both the target field (dependent variable) and the attributes (indepe...
184
click to vote
SPAA
1999
ACM
15 years 9 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...