522 search results - page 9 / 105 » On the Hardness of the Noncommutative Determinant |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
COR
2011
13 years 2 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
ICSE
2010
IEEE-ACM
13 years 9 months ago
2010
IEEE-ACM
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
ML
1998
ACM
13 years 7 months ago
1998
ACM
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
SIGECOM
2003
ACM
14 years 1 months ago
2003
ACM
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...