Sciweavers

2585 search results - page 296 / 517
» computing 1999
Sort
View
FOCS
1999
IEEE
15 years 8 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
COMPUTER
1999
64views more  COMPUTER 1999»
15 years 4 months ago
Innovation in the Small
Innovation in the small business can be conceived of as a management process and challenge. This process, when mapped, offers a framework that can be used to encourage and enhance...
Ted G. Lewis
IPPS
1999
IEEE
15 years 8 months ago
Recursive Individually Distributed Object
Abstract. Distributed Objects DO as de ned by OMG's CORBA architecture provide a model for object-oriented parallel distributed computing. The parallelism in this model howeve...
Z. George Mou
WOLLIC
2009
Springer
15 years 11 months ago
Sound and Complete Tree-Sequent Calculus for Inquisitive Logic
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...
Katsuhiko Sano
SIGCSE
2000
ACM
181views Education» more  SIGCSE 2000»
15 years 8 months ago
Evaluating individuals in team projects
In 1999, most computer science students participate in at least one group project in some class prior to graduation. However, assessing individual student contributions to a group...
Dawn Wilkins, Pamela B. Lawhead