Sciweavers

17366 search results - page 182 / 3474
» New Revision Algorithms
Sort
View
ICPPW
2005
IEEE
16 years 3 days ago
A New Multipath Routing Approach to Enhancing TCP Security in Ad Hoc Wireless Networks
— In a typical mobile ad hoc network, mobile computing devices wander autonomously and communicate via temporary links in a self-organized computing system without any central ad...
Zhi Li, Yu-Kwong Kwok
ICCSA
2004
Springer
15 years 12 months ago
New Parameter for Balancing Two Independent Measures in Routing Path
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
ICDM
2003
IEEE
181views Data Mining» more  ICDM 2003»
15 years 11 months ago
Dynamic Weighted Majority: A New Ensemble Method for Tracking Concept Drift
Algorithms for tracking concept drift are important for many applications. We present a general method based on the Weighted Majority algorithm for using any online learner for co...
Jeremy Z. Kolter, Marcus A. Maloof
ESTIMEDIA
2006
Springer
15 years 10 months ago
Neighbors-on-Path: A New Selection Strategy for On-Chip Networks
Efficient and deadlock-free routing is critical to the performance of networks-on-chip. In this paper we present an approach that can be coupled to any adaptive routing algorithm ...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi,...
EVOW
2006
Springer
15 years 10 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...