Sciweavers

644 search results - page 54 / 129
» A topological characterization of weakness
Sort
View
TPLP
2002
90views more  TPLP 2002»
15 years 5 months ago
Properties of input-consuming derivations
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic schedu...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
JC
2011
102views more  JC 2011»
15 years 1 months ago
Tractability of tensor product problems in the average case setting
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
Anargyros Papageorgiou, Iasonas Petras

Publication
466views
16 years 4 months ago
Multi-Armed Bandit Mechanisms for Multi-Slot Sponsored Search Auctions
In pay-per click sponsored search auctions which are cur- rently extensively used by search engines, the auction for a keyword involves a certain number of advertisers (say k) c...
Akash Das Sarma, Sujit Gujar, Y. Narahari
INFOCOM
2009
IEEE
16 years 28 days ago
Capacity Provisioning a Valiant Load-Balanced Network
—Valiant load balancing (VLB), also called two-stage load balancing, is gaining popularity as a routing scheme that can serve arbitrary traffic matrices. To date, VLB network de...
Andrew R. Curtis, Alejandro López-Ortiz
JMIV
1998
93views more  JMIV 1998»
15 years 6 months ago
Connectivity on Complete Lattices
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Jean Serra