Sciweavers

2266 search results - page 375 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 11 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
INFOCOM
2008
IEEE
15 years 10 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....
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 8 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 4 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
INFOCOM
2008
IEEE
15 years 10 months ago
Cell Selection in 4G Cellular Networks
—Cell selection is the process of determining the cell(s) that provide service to each mobile station. Optimizing these processes is an important step towards maximizing the util...
David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabr...