Sciweavers

COMMA
2010
13 years 11 hour ago
Dialectical Proofs for Constrained Argumentation
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
Caroline Devred, Sylvie Doutre, Claire Lefè...
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 6 months ago
The study for transportation planning considered the inventory using hybrid genetic algorithm
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
Shinichiro Ataka, Mitsuo Gen
IWDW
2005
Springer
13 years 10 months ago
On the Achievable Rate of Side Informed Embedding Techniques with Steganographic Constraints
The development of watermarking schemes in the literature is generally guided by a power constraint on the watermark to be embedded into the host. In a steganographic framework the...
Mark T. Hogan, Félix Balado, Neil J. Hurley...
INFOCOM
2005
IEEE
13 years 10 months ago
Understanding XCP: equilibrium and fairness
— We prove that the XCP equilibrium solves a constrained max-min fairness problem by identifying it with the unique solution of a hierarchy of optimization problems, namely those...
Steven H. Low, Lachlan L. H. Andrew, Bartek P. Wyd...
IWCMC
2006
ACM
13 years 11 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan