Sciweavers

6740 search results - page 73 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
SIAMDM
2008
140views more  SIAMDM 2008»
13 years 10 months ago
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
Daniel Král, Petr Skoda
ASE
2005
102views more  ASE 2005»
13 years 10 months ago
Tool-Supported Verification of Product Line Requirements
A recurring difficulty for organizations that employ a product-line approach to development is that when a new product is added to an existing product line, there is currently no a...
Prasanna Padmanabhan, Robyn R. Lutz
ESCIENCE
2007
IEEE
14 years 1 months ago
Using Ant Colony Optimisation to Improve the Efficiency of Small Meander Line RFID Antennas
Increasing the efficiency of meander line antennas is an important real-world problem within radio frequency identification (RFID). Meta-heuristic search algorithms, such as ant c...
Marcus Randall, Andrew Lewis, Amir Galehdar, David...
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
13 years 11 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
ISMIR
2004
Springer
157views Music» more  ISMIR 2004»
14 years 3 months ago
Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
Anna Lubiw, Luke Tanur