Sciweavers

519 search results - page 91 / 104
» A New Approach to Strongly Polynomial Linear Programming
Sort
View
GLOBECOM
2008
IEEE
15 years 6 months ago
Collusion-Resistant Multi-Winner Spectrum Auction for Cognitive Radio Networks
—In order to fully utilize spectrum, auction-based dynamic spectrum allocation has become a promising approach which allows unlicensed wireless users to lease unused bands from s...
Yongle Wu, Beibei Wang, K. J. Ray Liu, T. Charles ...
GLOBECOM
2007
IEEE
15 years 6 months ago
Using MILP for Optimal Movement Planning in MANETs with Cooperative Mobility
— Rapid-deployment mobile ad-hoc networks (MANETs) are frequently characterized by common overarching mission objectives which make it reasonable to expect some degree of coopera...
Ghassen Ben Brahim, Osama Awwad, Ala I. Al-Fuqaha,...
SAC
2004
ACM
15 years 5 months ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl
ICTAI
1997
IEEE
15 years 3 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
UAI
2004
15 years 29 days ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...