Sciweavers

1480 search results - page 205 / 296
» Ants can solve constraint satisfaction problems
Sort
View
EOR
2008
110views more  EOR 2008»
15 years 6 months ago
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
PADL
2007
Springer
16 years 17 days ago
From Zinc to Design Model
We describe a preliminary implementation of the high-level modelling language Zinc. This language supports a modelling methodology in which the same Zinc model can be automatically...
Reza Rafeh, Maria J. García de la Banda, Ki...
SPIRE
1999
Springer
15 years 10 months ago
Cross-Domain Approximate String Matching
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
Daniel P. Lopresti, Gordon T. Wilfong
CAD
2007
Springer
15 years 6 months ago
Non-iterative approach for global mesh optimization
This paper presents a global optimization operator for arbitrary meshes. The global optimization operator is composed of two main terms, one part is the global Laplacian operator ...
Ligang Liu, Chiew-Lan Tai, Zhongping Ji, Guojin Wa...
ICFEM
2004
Springer
15 years 11 months ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom