Sciweavers

16404 search results - page 893 / 3281
» A set coverage problem
Sort
View
MP
2002
85views more  MP 2002»
15 years 7 months ago
Generalized Goal Programming: polynomial methods and applications
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
Emilio Carrizosa, Jörg Fliege
MP
1998
134views more  MP 1998»
15 years 7 months ago
Second-order global optimality conditions for convex composite optimization
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...
Xiaoqi Yang
CORR
2008
Springer
127views Education» more  CORR 2008»
15 years 7 months ago
Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks
The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes f...
Adnan Vora, Mikhail Nesterenko, Sébastien T...
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 7 months ago
Efficient Isomorphism Testing for a Class of Group Extensions
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
François Le Gall
OL
2007
121views more  OL 2007»
15 years 7 months ago
Global optimization by continuous grasp
We introduce a novel global optimization method called Continuous GRASP (C-GRASP) which extends Feo and Resende’s greedy randomized adaptive search procedure (GRASP) from the dom...
Michael J. Hirsch, Cláudio Nogueira de Mene...