Sciweavers

6693 search results - page 969 / 1339
» Methods of Automatic Algorithm Generation
Sort
View
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
15 years 9 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
15 years 9 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
WMCSA
1999
IEEE
15 years 8 months ago
Broadcast of Consistent Data to Read-Only Transactions from Mobile Clients
In this paper, we study the inconsistency problem in data broadcast. While data items in a mobile computing system are being broadcast, update transactions may install new values ...
Kam-yiu Lam, Mei-Wau Au, Edward Chan
AIRS
2006
Springer
15 years 7 months ago
A Novel Ant-Based Clustering Approach for Document Clustering
Recently, much research has been proposed using nature inspired algorithms to perform complex machine learning tasks. Ant Colony Optimization (ACO) is one such algorithm based on s...
Yulan He, Siu Cheung Hui, Yongxiang Sim
CGO
2004
IEEE
15 years 7 months ago
Optimizing Translation Out of SSA Using Renaming Constraints
Static Single Assignment form is an intermediate representation that uses instructions to merge values at each confluent point of the control flow graph. instructions are not ma...
Fabrice Rastello, François de Ferriè...