Sciweavers

2266 search results - page 236 / 454
» Some Solutions to the Ignoring Problem
Sort
View
ICASSP
2008
IEEE
16 years 1 months ago
Reconstructing sparse signals from their zero crossings
Classical sampling records the signal level at pre-determined time instances, usually uniformly spaced. An alternative implicit sampling model is to record the timing of pre-deter...
Petros Boufounos, Richard G. Baraniuk
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
16 years 26 days ago
Self-adaptive simulated binary crossover for real-parameter optimization
Simulated binary crossover (SBX) is a real-parameter recombination operator which is commonly used in the evolutionary algorithm (EA) literature. The operator involves a parameter...
Kalyanmoy Deb, Karthik Sindhya, Tatsuya Okabe
IPPS
2005
IEEE
16 years 8 days ago
Distributed Scheduling of Parallel I/O in the Presence of Data Replication
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
Jan-Jan Wu, Pangfeng Liu
WIOPT
2005
IEEE
16 years 8 days ago
Securing Route Optimisation in NEMO
The Network Mobility (NEMO) Basic Support protocol enables mobile networks to change their point of attachment to the Internet, while preserving established sessions of the nodes ...
María Calderón, Carlos Jesus Bernard...
MFCS
2005
Springer
16 years 5 days ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher