Sciweavers

352 search results - page 34 / 71
» On the optimal reachability problem of weighted timed automa...
Sort
View
CAI
2007
Springer
14 years 1 months ago
Learning Deterministically Recognizable Tree Series - Revisited
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
Andreas Maletti
INFOCOM
2011
IEEE
12 years 11 months ago
Optimal channel assignment and power allocation for dual-hop multi-channel multi-user relaying
Abstract—We consider the problem of jointly optimizing channel pairing, channel-user assignment, and power allocation in a single-relay multiple-access system. The optimization o...
Mahdi Hajiaghayi, Min Dong, Ben Liang
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
13 years 12 months ago
Adaptive minimax filtering via recursive optimal quadratic approximations
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
S. Gollamudi, Yih-Fang Huang
TON
2008
119views more  TON 2008»
13 years 7 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 1 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom