6455 search results - page 141 / 1291 » Research problems |
180
click to vote
ACID
2006
15 years 7 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
171
click to vote
FC
2005
Springer
15 years 12 months ago
2005
Springer
One of today’s fastest growing crimes is identity theft – the unauthorized use and exploitation of another individual’s identitycorroborating information. It is exacerbated b...
147
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
171
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
134
click to vote
ICSE
2001
IEEE-ACM
15 years 10 months ago
2001
IEEE-ACM
The 4th ICSE workshop on “Software Engineering over the Internet” brought together researchers and practitioners that are trying to use Internet technologies to overcome probl...