16404 search results - page 538 / 3281 » A set coverage problem |
176
click to vote
IEAAIE
2001
Springer
15 years 11 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
188
click to vote
SAC
2000
ACM
15 years 11 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
205
click to vote
ISAAC
2000
Springer
15 years 10 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
179
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract- Significant operational cost and energy savings can be achieved by optimising the schedules of pumps, which pump water from source reservoirs to storage tanks, in Water ...
219
click to vote
PKC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...