Sciweavers

666 search results - page 114 / 134
» When Similar Problems Don't Have Similar Solutions
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
SEE
2010
Springer
13 years 6 months ago
Can Instruction in Engineering Ethics Change Students' Feelings about Professional Responsibility?
How can a course on engineering ethics affect an undergraduate student’s feelings of responsibility about moral problems? In this study, three groups of students were interviewed...
Golnaz Hashemian, Michael C. Loui
DAIS
2003
13 years 9 months ago
Rational Server Selection for Mobile Agents
- Mobile agents have the ability to migrate through heterogeneous networks and execute at remote hosts. This ability can be exploited to improve the performance of agent based appl...
Carsten Pils, Stefan Diepolder
INFOVIS
2003
IEEE
14 years 28 days ago
Mapping Nominal Values to Numbers for Effective Visualization
Data sets with a large number of nominal variables, some with high cardinality, are becoming increasingly common and need to be explored. Unfortunately, most existing visual explo...
Geraldine E. Rosario, Elke A. Rundensteiner, David...
EDBT
2000
ACM
14 years 1 hour ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel