Sciweavers

3155 search results - page 140 / 631
» How Are You Doing
Sort
View
MFCS
2004
Springer
14 years 1 months ago
All Superlinear Inverse Schemes Are coNP-Hard
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds dia...
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald H...
ARITH
2003
IEEE
14 years 1 months ago
"Partially Rounded" Small-Order Approximations for Accurate, Hardware-Oriented, Table-Based Methods
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose orde...
Jean-Michel Muller
EGOV
2003
Springer
14 years 1 months ago
Affordances in e-Government
Abstract. If co-operating government agencies reside in different countries, they will differ in many respects: administrative ontologies and laws, political context, administrativ...
Reinhard Riedl
ICRE
1998
IEEE
14 years 4 days ago
A Case for Priority
Prioritizing requirements can play a significant role in reducing requirement problems and increasing customer satisfaction. This paper describes our experiences in teaching requi...
Ivy Hooks
EPIA
1997
Springer
14 years 1 days ago
Controlling for Unexpected Goals when Planning in a Mixed-Initiative Setting
dimension of abstraction and specificity, and they may mix both top-level goals and subgoals when describing what they want a plan to do. We show how the Prodigy planning system h...
Michael T. Cox, Manuela M. Veloso