Sciweavers

380 search results - page 36 / 76
» Instance Matching with COMA
Sort
View
CEC
2005
IEEE
14 years 1 months ago
FPGA segmented channel routing using genetic algorithms
A genetic algorithm approach for segmented channel routing in field programmable gate arrays (FPGA's) is presented in this paper. The FPGA segmented channel routing problem (F...
Lipo Wang, Lei Zhou, Wen Liu
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
14 years 16 days ago
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
Aleksander Madry
ASIAN
1998
Springer
101views Algorithms» more  ASIAN 1998»
13 years 12 months ago
The Rewriting Calculus as a Semantics of ELAN
call it, provides abstraction through the rewriting arrow and explicit rule application. It also embeds the notion of sets of results to deal with non-deterministic computations. F...
Horatiu Cirstea, Claude Kirchner
EMNLP
2007
13 years 9 months ago
Using Semantic Roles to Improve Question Answering
Shallow semantic parsing, the automatic identification and labeling of sentential constituents, has recently received much attention. Our work examines whether semantic role info...
Dan Shen, Mirella Lapata
ARSCOM
2008
117views more  ARSCOM 2008»
13 years 7 months ago
Subset Counting in Trees
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
Stephan G. Wagner