[PostDoc] R
Forum 'Emplois' - Sujet créé le 2006-01-30 par Thomas Schiex
With apologies for multiple copies:
Post-Doc position WEIGHTED CONSTRAINT PROCESSING
Applied mathematics and computer science department
Toulouse INRA
FRANCE
A 2 years postdoc position is available in our lab. in the Applied Mathematics and Computer sciences dept. at INRA in the frame of a ANR (french NSF) founded project. The project is aimed at the development, implementation and experimentation of algorithms for solving weighted constraint networks by mixing local consistency enforcing and dynamic programming like approaches. It involves three teams with a nice research record in graph decomposition, weighted constraint processing and the use of decomposition for solving weighted constraint networks and with active relations with other teams in France, Italy, Spain...
The project offers a nice spectrum of research from graph theory, development of new algorithms for weighted constraint processing, their implementation in a new platform and application to problems in biology (pedigree analysis, RNA gene finding...) using recent hardware with a large memory.
The ideal applicant will have a good knowledge of constraint processing and a taste for algorithmic development from theory to practice. Programming skills are essential. Additional knowledge in weighted constraint processing, graph decomposition and related methods is welcome. General knowledge of biology and genetics is welcome but not essential. French or english speaking is needed.
The contract should start around June 2006 (with some flexibility) and is renewable for a total duration of 2 years roughly.
Prospective applicants should contact Thomas Schiex (http://www.inra.fr/mia/T/schiex) by phone or e-mail before March 26th, 2006. Use [ANR POSTDOC] for the e-mail subject.
[b][/b][b][/b]
Post-Doc position WEIGHTED CONSTRAINT PROCESSING
Applied mathematics and computer science department
Toulouse INRA
FRANCE
A 2 years postdoc position is available in our lab. in the Applied Mathematics and Computer sciences dept. at INRA in the frame of a ANR (french NSF) founded project. The project is aimed at the development, implementation and experimentation of algorithms for solving weighted constraint networks by mixing local consistency enforcing and dynamic programming like approaches. It involves three teams with a nice research record in graph decomposition, weighted constraint processing and the use of decomposition for solving weighted constraint networks and with active relations with other teams in France, Italy, Spain...
The project offers a nice spectrum of research from graph theory, development of new algorithms for weighted constraint processing, their implementation in a new platform and application to problems in biology (pedigree analysis, RNA gene finding...) using recent hardware with a large memory.
The ideal applicant will have a good knowledge of constraint processing and a taste for algorithmic development from theory to practice. Programming skills are essential. Additional knowledge in weighted constraint processing, graph decomposition and related methods is welcome. General knowledge of biology and genetics is welcome but not essential. French or english speaking is needed.
The contract should start around June 2006 (with some flexibility) and is renewable for a total duration of 2 years roughly.
Prospective applicants should contact Thomas Schiex (http://www.inra.fr/mia/T/schiex) by phone or e-mail before March 26th, 2006. Use [ANR POSTDOC] for the e-mail subject.
[b][/b][b][/b]