Sciweavers

698 search results - page 127 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
14 years 1 months ago
An empirical study on the handling of overlapping solutions in evolutionary multiobjective optimization
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...
Hisao Ishibuchi, Kaname Narukawa, Yusuke Nojima
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 8 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 4 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
CPAIOR
2008
Springer
13 years 9 months ago
Propagating Separable Equalities in an MDD Store
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
Tarik Hadzic, John N. Hooker, Peter Tiedemann
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 7 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite