Sciweavers

14165 search results - page 2712 / 2833
» The generalized two-server problem
Sort
View
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
15 years 10 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton
ROBOCUP
1999
Springer
129views Robotics» more  ROBOCUP 1999»
15 years 10 months ago
The Ulm Sparrows 99
In RoboCup-98, sparrows team worked hard just to get both a simulation and a middle size robot team to work and to successfully participate in a major tournament. For this year, we...
Stefan Sablatnög, Stefan Enderle, Mark Dettin...
ELPUB
1998
ACM
15 years 10 months ago
Research Information Take Away or How to Serve Research Information Fast and Friendly on the Web
In 1997 the library department at the University of Karlskrona/Ronneby was asked to develop a database which could be used to collate and present all the research material and ong...
Peter Linde, Leif Lagebrand
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
15 years 10 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...
CP
1998
Springer
15 years 10 months ago
Error-Correcting Source Code
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...
Yasuhiro Ajiro, Kazunori Ueda, Kenta Cho
« Prev « First page 2712 / 2833 Last » Next »