16404 search results - page 195 / 3281 » A set coverage problem |
204
Voted
OTM
2004
Springer
16 years 10 days ago
2004
Springer
Abstract. To date, ontology research seems to have come to an equilibrium: there is a wide variety of theories, methods and tools for extracting, representing, storing and browsing...
125
click to vote
IDA
1997
Springer
15 years 11 months ago
1997
Springer
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
196
Voted
CAV
2008
Springer
15 years 9 months ago
2008
Springer
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
192
click to vote
IAT
2009
IEEE
16 years 1 months ago
2009
IEEE
Automating negotiations in markets where multiple buyers and sellers operate is a scientific challenge of extraordinary importance. One-to-one negotiations are classically studie...
160
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...