Sciweavers

16504 search results - page 170 / 3301
» New Problems, New Solutions
Sort
View
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 6 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
ACNS
2009
Springer
143views Cryptology» more  ACNS 2009»
16 years 1 months ago
A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks
Abstract. We examine the problem of message recognition by reviewing the definitions and the security model in the literature. In particular, we examine the Jane Doe protocol, whi...
Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 10 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
INTERACT
2003
15 years 7 months ago
Creating New User Experiences to Enhance Collaboration
: When technologies are introduced into collaborative settings, people are often required to work together in new, unfamiliar ways. This can lead to problems of resistance, and eve...
John Halloran, Yvonne Rogers, Tom Rodden, Ian Tayl...
CG
2005
Springer
15 years 6 months ago
A new algorithm for Boolean operations on general polygons
A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edge...
Yu Peng, Jun-Hai Yong, Wei-Ming Dong, Hui Zhang, J...