Sciweavers

514 search results - page 61 / 103
» Foundations of Aggregation Constraints
Sort
View
106
Voted
MP
2010
154views more  MP 2010»
14 years 9 months ago
A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...
Xinwei Liu, Yaxiang Yuan
156
Voted
DC
2011
13 years 10 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
131
Voted
DIMACS
1996
15 years 7 days ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
TWC
2010
14 years 5 months ago
Efficient Spectrum Leasing via Randomized Silencing of Secondary Users
In this paper, a primary (licensed) user leases part of its resources to independent secondary (unlicensed) terminals in exchange for a tariff in dollars per bit, under the constra...
Rocco Di Taranto, Petar Popovski, Osvaldo Simeone,...
ICDE
1995
IEEE
192views Database» more  ICDE 1995»
16 years 7 days ago
Mining Sequential Patterns
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...
Rakesh Agrawal, Ramakrishnan Srikant