Sciweavers

61 search results - page 10 / 13
» On the Complexity of the Balanced Vertex Ordering Problem
Sort
View
ATAL
2003
Springer
14 years 1 months ago
A principled study of the design tradeoffs for autonomous trading agents
In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...
Ioannis A. Vetsikas, Bart Selman
COMPUTING
2006
130views more  COMPUTING 2006»
13 years 7 months ago
Factorized Solution of Lyapunov Equations Based on Hierarchical Matrix Arithmetic
We investigate the numerical solution of large-scale Lyapunov equations with the sign function method. Replacing the usual matrix inversion, addition, and multiplication by format...
Ulrike Baur, Peter Benner
DKE
2007
105views more  DKE 2007»
13 years 7 months ago
On compressing frequent patterns
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
COMPGEOM
2006
ACM
14 years 1 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
GLOBECOM
2008
IEEE
14 years 2 months ago
Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-Hoc Networks
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
Senni Perumal, John S. Baras