2251 search results - page 184 / 451 » Specification and Implementation Problems for C |
151
click to vote
JCM
2007
15 years 3 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
170
click to vote
SIAMREV
2010
14 years 10 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
153
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
204
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
We demonstrate the schema and ontology matching tool COMA++. It extends our previous prototype COMA utilizing a composite approach to combine different match algorithms [3]. COMA+...
130
click to vote
KDD
2000
ACM
15 years 7 months ago
2000
ACM
Predictive models in direct marketing seek to identify individuals most likely to respond to promotional solicitations or other intervention programs. While standard modeling appr...