Sciweavers

780 search results - page 87 / 156
» A New Identification Scheme Based on the Perceptrons Problem
Sort
View
AROBOTS
2002
130views more  AROBOTS 2002»
13 years 7 months ago
Dynamic Motion Planning for Mobile Robots Using Potential Field Method
The potential field method is widely used for autonomous mobile robot path planning due to its elegant mathematical analysis and simplicity. However, most researches have been focu...
Shuzhi Sam Ge, Youjing Cui

Publication
319views
12 years 5 months ago
 Viability Evolution: Elimination and Extinction in Evolutionary Computation
Current mainstream Evolutionary Algorithms (EA) are based on the concept of selection, encapsulated in the definition of a fitness function. Besides selection, however, the natur...
Claudio Mattiussi
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 7 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
CN
2004
99views more  CN 2004»
13 years 7 months ago
Efficient peer location on the Internet
We consider the problem of locating nearby application peers over the Internet. We define a new peer-location scheme (called Tiers), that scales to large application peer groups. ...
Suman Banerjee, Christopher Kommareddy, Bobby Bhat...
TIP
2002
116views more  TIP 2002»
13 years 7 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong