1026 search results - page 39 / 206 » On Finding Minimal w-cutset |
SODA
2004
ACM
13 years 10 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
ACL
1996
13 years 10 months ago
1996
Corpus-based methods for natural language processing often use supervised training, requiring expensive manual annotation of training corpora. This paper investigates methods for ...
FS
2006
13 years 9 months ago
2006
We study the problem of finding optimal strategies for a life insurance company or pension fund that acts on behalf of an insured so as to maximize the expected utility (in a gene...
BROADNETS
2007
IEEE
14 years 3 months ago
2007
IEEE
—Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flo...
CONSTRAINTS
2006
13 years 9 months ago
2006
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...