Sciweavers

6455 search results - page 408 / 1291
» Research problems
Sort
View
AAECC
2006
Springer
125views Algorithms» more  AAECC 2006»
15 years 6 months ago
Combinatorial Group Theory and Public Key Cryptography
Abstract. After some excitement generated by recently suggested public key exchange protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al., it is a prevalent opinion now that th...
Vladimir Shpilrain, Gabriel Zapata
IPL
2008
89views more  IPL 2008»
15 years 6 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
ECCC
2007
99views more  ECCC 2007»
15 years 6 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
AAMAS
2005
Springer
15 years 6 months ago
Efficient Management of Multi-Linked Negotiation Based on a Formalized Model
A Multi-linked negotiation problem occurs when an agent needs to negotiate with multiple other agents about different subjects (tasks, conflicts, or resource requirements), and th...
Xiaoqin Zhang, Victor R. Lesser, Sherief Abdallah
IEE
2002
72views more  IEE 2002»
15 years 6 months ago
Making inferences with small numbers of training sets
This paper discusses a potential methodological problem with empirical studies assessing project effort prediction systems. Frequently a hold-out strategy is deployed so that the ...
Colin Kirsopp, Martin J. Shepperd