Sciweavers

12697 search results - page 2471 / 2540
» Call for Papers
Sort
View
TCAD
2008
128views more  TCAD 2008»
13 years 7 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...
TCS
2008
13 years 7 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas
TCSB
2008
13 years 7 months ago
On Channel Capacity and Error Compensation in Molecular Communication
Abstract. Molecular communication is a novel paradigm that uses molecules as an information carrier to enable nanomachines to communicate with each other. Controlled molecule deliv...
Baris Atakan, Özgür B. Akan
IR
2007
13 years 7 months ago
Restricted inflectional form generation in management of morphological keyword variation
Word form normalization through lemmatization or stemming is a standard procedure in information retrieval because morphological variation needs to be accounted for and several la...
Kimmo Kettunen, Eija Airio, Kalervo Järvelin
JAIR
2007
132views more  JAIR 2007»
13 years 7 months ago
New Inference Rules for Max-SAT
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...
Chu Min Li, Felip Manyà, Jordi Planes
« Prev « First page 2471 / 2540 Last » Next »