Sciweavers

10271 search results - page 1976 / 2055
» Computer Science
Sort
View
JCM
2007
131views more  JCM 2007»
15 years 2 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
VLC
2008
191views more  VLC 2008»
15 years 2 months ago
Visual specification of measurements and redesigns for domain specific visual languages
Ensuring model quality is a key success factor in many computer science areas, and becomes crucial in recent software engineering paradigms like the one proposed by model-driven s...
Esther Guerra, Juan de Lara, Paloma Díaz
118
Voted
MANSCI
2007
121views more  MANSCI 2007»
15 years 2 months ago
Yahoo! for Amazon: Sentiment Extraction from Small Talk on the Web
Extracting sentiment from text is a hard semantic problem. We develop a methodology for extracting small investor sentiment from stock message boards. The algorithm comprises diï¬...
Sanjiv R. Das, Mike Y. Chen
BMCBI
2002
120views more  BMCBI 2002»
15 years 2 months ago
tacg - a grep for DNA
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
Harry Mangalam
JAIR
2002
122views more  JAIR 2002»
15 years 2 months ago
Competitive Safety Analysis: Robust Decision-Making in Multi-Agent Systems
Much work in AI deals with the selection of proper actions in a given (known or unknown) environment. However, the way to select a proper action when facing other agents is quite ...
Moshe Tennenholtz
« Prev « First page 1976 / 2055 Last » Next »