1095 search results - page 157 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
118
click to vote
PODC
2003
ACM
15 years 7 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
124
click to vote
MST
2006
15 years 2 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
119
Voted
HIPC
2003
Springer
15 years 7 months ago
2003
Springer
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
130
click to vote
IOR
2007
15 years 2 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
133
Voted
GIS
2009
ACM
15 years 9 months ago
2009
ACM
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...