Sciweavers

16504 search results - page 358 / 3301
» New Problems, New Solutions
Sort
View
ICSE
1998
IEEE-ACM
15 years 11 months ago
The Ramp-Up Problem in Software Projects: A Case Study of How Software Immigrants Naturalize
Joining a software development team is like moving to a new country to start employment; the immigrant has a lot to learn about the job, the local customs, and sometimes a new lan...
Susan Elliott Sim, Richard C. Holt
PR
2008
93views more  PR 2008»
15 years 6 months ago
Genetic algorithm-based feature set partitioning for classification problems
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...
Lior Rokach
ISW
2007
Springer
16 years 27 days ago
Towards a DL-Based Additively Homomorphic Encryption Scheme
ElGamal scheme has been the first encryption scheme based on discrete logarithm. One of its main advantage is that it is simple, natural and efficient, but also that its security ...
Guilhem Castagnos, Benoît Chevallier-Mames
ASPDAC
2006
ACM
98views Hardware» more  ASPDAC 2006»
16 years 22 days ago
Timing-driven placement based on monotone cell ordering constraints
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
Chanseok Hwang, Massoud Pedram
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
16 years 7 days ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...