Sciweavers

2441 search results - page 393 / 489
» Engineering a Tool to Detect Automatically Generated Papers
Sort
View
CP
2003
Springer
15 years 5 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
96
Voted
ITSSA
2006
129views more  ITSSA 2006»
15 years 18 days ago
A MultiAgent System for Classifying Bioinformatics Publications
Abstract. A growing amounts of information are currently being generated and stored in the World Wide Web (WWW), in particular, researchers in any field can find a lot of publicati...
Eloisa Vargiu, Andrea Addis
COMPSAC
1999
IEEE
15 years 5 months ago
Dynamic Software Architecture Slicing
As the complexity of software systems increases, so need for a good mechanism of abstraction. architecture design is an abstraction, hiding an immense amount of details about the ...
Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T....
RE
2008
Springer
15 years 3 days ago
Rule-Based Maintenance of Post-Requirements Traceability Relations
An accurate set of traceability relations between software development artifacts is desirable to support evolutionary development. However, even where an initial set of traceabili...
Patrick Mäder, Orlena Gotel, Ilka Philippow
126
Voted
CGO
2009
IEEE
15 years 4 months ago
Communication-Sensitive Static Dataflow for Parallel Message Passing Applications
Message passing is a very popular style of parallel programming, used in a wide variety of applications and supported by many APIs, such as BSD sockets, MPI and PVM. Its importance...
Greg Bronevetsky