Sciweavers

6562 search results - page 383 / 1313
» Noetherianity and Combination Problems
Sort
View
CEC
2009
IEEE
16 years 1 months ago
Enhancing MOEA/D with guided mutation and priority update for multi-objective optimization
—Multi-objective optimization is an essential and challenging topic in the domains of engineering and computation because real-world problems usually include several conflicting...
Chih-Ming Chen, Ying-Ping Chen, Qingfu Zhang
ICSM
2009
IEEE
16 years 1 months ago
A combinatorial approach to building navigation graphs for dynamic web applications
Modeling the navigation structure of a dynamic web application is a challenging task because of the presence of dynamic pages. In particular, there are two problems to be dealt wi...
Wenhua Wang, Yu Lei, Sreedevi Sampath, Raghu Kacke...
INFOCOM
2008
IEEE
16 years 1 months ago
Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks
— In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flo...
Umut Akyol, Matthew Andrews, Piyush Gupta, John D....
FOCS
2005
IEEE
16 years 13 days ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
CPAIOR
2005
Springer
16 years 11 days ago
Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations
We describe the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne telescope. The problem requires maximizing the nu...
Jeremy Frank, Elif Kürklü