Sciweavers

7421 search results - page 221 / 1485
» In search of dependable design
Sort
View
SOFSEM
2007
Springer
16 years 23 days ago
Constraints for Argument Filterings
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
Harald Zankl, Nao Hirokawa, Aart Middeldorp
DEXA
2001
Springer
91views Database» more  DEXA 2001»
15 years 11 months ago
Towards the Development of Heuristics for Automatic Query Expansion
Abstract. In this paper we study the performance of linguisticallymotivated conflation techniques for Information Retrieval in Spanish. In particular, we have studied the applicat...
Jesús Vilares, Manuel Vilares Ferro, Miguel...
AIPS
2008
15 years 9 months ago
A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
Miguel A. González, Camino R. Vela, Ramiro ...
ICWSM
2010
15 years 8 months ago
Devils, Angels, and Robots: Tempting Destructive Users in Social Media
Social media sites derive their value by providing a popular and dependable community for participants to engage, share, and interact. This community value and related services li...
Kyumin Lee, Brian David Eoff, James Caverlee
LREC
2008
158views Education» more  LREC 2008»
15 years 8 months ago
Linguistic Description and Automatic Extraction of Definitions from German Court Decisions
This paper discusses the use of computational linguistic technology to extract definitions from a large corpus of German court decisions. We present a corpus-based survey of defin...
Stephan Walter