6562 search results - page 267 / 1313 » Noetherianity and Combination Problems |
168
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
171
click to vote
ECBS
2000
IEEE
15 years 11 months ago
2000
IEEE
The design of a large component-based software system typically involves the composition of different components. Instead of relying on a free composition of components, we advoca...
177
click to vote
ICTAI
1999
IEEE
15 years 11 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
191
click to vote
CISC
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
134
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...