7773 search results - page 105 / 1555 » On generalized Frame-Stewart numbers |
143
click to vote
AIR
2004
15 years 6 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
191
click to vote
ML
2007
ACM
15 years 5 months ago
2007
ACM
We offer a new formal criterion for agent-centric learning in multi-agent systems, that is, learning that maximizes one’s rewards in the presence of other agents who might also...
127
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymp...
175
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two rou...
159
click to vote
ICISC
2008
15 years 7 months ago
2008
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...