Sciweavers

5473 search results - page 755 / 1095
» On the graph isomorphism problem
Sort
View
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
16 years 7 days ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
EUROCRYPT
2005
Springer
16 years 7 days ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
15 years 11 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
HAIS
2009
Springer
15 years 11 months ago
Evolutionary Non-linear Great Deluge for University Course Timetabling
This paper presents a hybrid evolutionary algorithm to tackle university course timetabling problems. The proposed approach is an extension of a non-linear great deluge algorithm i...
Dario Landa Silva, Joe Henry Obit
175
Voted
DNA
2001
Springer
139views Bioinformatics» more  DNA 2001»
15 years 11 months ago
DNA Computing in Microreactors
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
Danny van Noort, Frank-Ulrich Gast, John S. McCask...