537 search results - page 47 / 108 » Problems from CGCS Luminy, May 2007 |
OPODIS
2004
15 years 18 days ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
SEC
2004
15 years 18 days ago
2004
Business Processes for Web Services (BPEL4WS) are the new paradigms for lightweight enterprise integration. They cross organizational boundaries and are provided by entities that s...
AIEDU
2007
14 years 11 months ago
2007
Opening a model of the learner is a potentially complex operation. There are many aspects of the learner that can be modelled, and many of these aspects may need to be opened in di...
100
click to vote
STOC
2007
ACM
15 years 11 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
EOR
2007
14 years 11 months ago
2007
— We describe a solution procedure for a special case of the periodic vehicle routing problem (PVRP). Operation managers at an auto parts in the north of Spain described the opti...