14190 search results - page 2453 / 2838 » computing 2008 |
150
click to vote
IOR
2007
15 years 4 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...
128
Voted
IOR
2007
15 years 4 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
124
click to vote
IPL
2007
15 years 4 months ago
2007
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
146
click to vote
TCS
2008
15 years 4 months ago
2008
Mobile sensors can self-deploy in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they cover uniformly the enviro...
167
click to vote
IPM
2007
15 years 4 months ago
2007
In this paper, we propose a multi-strategic matching and merging approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constr...